@pastermil@sh.itjust.works to Programmer Humor@programming.dev • 1 year agoThat Nim Flashbackssh.itjust.worksimagemessage-square52fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1imageThat Nim Flashbackssh.itjust.works@pastermil@sh.itjust.works to Programmer Humor@programming.dev • 1 year agomessage-square52fedilink
minus-square@Daxtron2@startrek.websitelinkfedilink0•1 year agoNah Hanoi was easy stuff, first year. Definitely more traumatizing practice problems.
minus-square@Alexstarfire@lemmy.worldlinkfedilink0•1 year agoYea, get back to me when you get to parallel programming.
minus-squareladlinkfedilinkEnglish0•1 year agoTis’ not hard, just add some sleeps to make sure other thread reads data before it is destroyed 🌚
minus-square@FierySpectre@lemmy.worldlinkfedilink0•1 year agoWriting kernels for parallel execution with OPENCL gives me flashbacks every time I remember them
minus-squareladlinkfedilinkEnglish0•1 year ago 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 exam
minus-squareJohnEdwalinkfedilink0•1 year agoAssuming 1 second per swap, a 64 disk tower of hanoi would take 585 billion years to solve - it has 2^64 -1 swaps.
Nah Hanoi was easy stuff, first year. Definitely more traumatizing practice problems.
Yea, get back to me when you get to parallel programming.
Tis’ not hard, just add some sleeps to make sure other thread reads data before it is destroyed 🌚
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
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