This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.
Did you know that you can sort data in time linear with respect to the lenght of said data? Some people dismiss linear time sorts because they’ve learned that n log n is the bottom bound for sorting an arbitrary input. But n log n is optimal!? Let’s even sketch out a proof. Any function that sorts an array of elements will in fact figure out a permutation of elements into a sorted…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.