@pastermil to Programmer [email protected] • 1 month agoThat Nim Flashbacksimagemessage-square56arrow-up1827arrow-down18
arrow-up1819arrow-down1imageThat Nim Flashbacks@pastermil to Programmer [email protected] • 1 month agomessage-square56
minus-square@[email protected]linkfedilink38•1 month agoNah Hanoi was easy stuff, first year. Definitely more traumatizing practice problems.
minus-squareladlinkfedilinkEnglish10•1 month 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-squareJohnEdwalinkfedilink2•1 month agoAssuming 1 second per swap, a 64 disk tower of hanoi would take 585 billion years to solve - it has 2^64 -1 swaps.
minus-square@[email protected]linkfedilink6•1 month agoYea, get back to me when you get to parallel programming.
minus-square@[email protected]linkfedilink3•1 month agoWriting kernels for parallel execution with OPENCL gives me flashbacks every time I remember them
minus-squareladlinkfedilinkEnglish1•1 month agoTis’ 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 🌚