That Nim Flashbackspastermil@sh.itjust.works to Programmer Humor@programming.dev – 814 points – 7 months ago50Post a CommentPreviewYou are viewing a single commentView all commentsNah Hanoi was easy stuff, first year. Definitely more traumatizing practice problems. Hanoi […] practice problems. Like you come to the exam and there's a 64 piece Tower of Hanoi you need to solve manually to pass the examAssuming 1 second per swap, a 64 disk tower of hanoi would take 585 billion years to solve - it has 2^64 -1 swaps.And that makes It good enough for an examCalm down, satanYea, get back to me when you get to parallel programming.Writing kernels for parallel execution with OPENCL gives me flashbacks every time I remember themOr even just try to understand pthreads.You’re doing it againTis' not hard, just add some sleeps to make sure other thread reads data before it is destroyed 🌚
Nah Hanoi was easy stuff, first year. Definitely more traumatizing practice problems. Hanoi […] practice problems. Like you come to the exam and there's a 64 piece Tower of Hanoi you need to solve manually to pass the examAssuming 1 second per swap, a 64 disk tower of hanoi would take 585 billion years to solve - it has 2^64 -1 swaps.And that makes It good enough for an examCalm down, satanYea, get back to me when you get to parallel programming.Writing kernels for parallel execution with OPENCL gives me flashbacks every time I remember themOr even just try to understand pthreads.You’re doing it againTis' not hard, just add some sleeps to make sure other thread reads data before it is destroyed 🌚
Hanoi […] practice problems. Like you come to the exam and there's a 64 piece Tower of Hanoi you need to solve manually to pass the examAssuming 1 second per swap, a 64 disk tower of hanoi would take 585 billion years to solve - it has 2^64 -1 swaps.And that makes It good enough for an examCalm down, satan
Assuming 1 second per swap, a 64 disk tower of hanoi would take 585 billion years to solve - it has 2^64 -1 swaps.And that makes It good enough for an exam
Yea, get back to me when you get to parallel programming.Writing kernels for parallel execution with OPENCL gives me flashbacks every time I remember themOr even just try to understand pthreads.You’re doing it againTis' not hard, just add some sleeps to make sure other thread reads data before it is destroyed 🌚
Nah Hanoi was easy stuff, first year. Definitely more traumatizing practice problems.
Like you come to the exam and there's a 64 piece Tower of Hanoi you need to solve manually to pass the exam
Assuming 1 second per swap, a 64 disk tower of hanoi would take 585 billion years to solve - it has 2^64 -1 swaps.
And that makes It good enough for an exam
Calm down, satan
Yea, get back to me when you get to parallel programming.
Writing kernels for parallel execution with OPENCL gives me flashbacks every time I remember them
Or even just try to understand pthreads.
You’re doing it again
Tis' not hard, just add some sleeps to make sure other thread reads data before it is destroyed 🌚