@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-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.
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