@[email protected] to Programmer [email protected] • 1 year agoThat Nim Flashbackssh.itjust.worksimagemessage-square56fedilinkarrow-up1826
arrow-up1826imageThat Nim Flashbackssh.itjust.works@[email protected] to Programmer [email protected] • 1 year agomessage-square56fedilink
minus-square@[email protected]linkfedilink39•1 year agoNah Hanoi was easy stuff, first year. Definitely more traumatizing practice problems.
minus-square@[email protected]linkfedilink8•1 year agoYea, get back to me when you get to parallel programming.
minus-square@[email protected]linkfedilink3•1 year agoWriting kernels for parallel execution with OPENCL gives me flashbacks every time I remember them
minus-squareladlinkfedilinkEnglish1•1 year agoTis’ not hard, just add some sleeps to make sure other thread reads data before it is destroyed 🌚
minus-squareladlinkfedilinkEnglish10•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-squareJohnEdwalinkfedilink3•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.
Writing kernels for parallel execution with OPENCL gives me flashbacks every time I remember them
Tis’ not hard, just add some sleeps to make sure other thread reads data before it is destroyed 🌚
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