Post #2423059

@multisn8@mastodon.catgirl.cloud Super interesting fact from that speech is that he invented Quicksort in a language that did not have recursion. It was an assembly language, and that meant not having “call”. The computer could store its PC, and jump back to a stored PC, but if you wanted to invent Quicksort you needed to invent the stack, first: visit https://en.wikipedia.org/wiki/Elliott_803 and scroll down to “Entry to a subroutine at address N is normally effected by the sequence:”