3 ms·
Will you still think that when you realize it isn't actually a quicksort?
by CyberDildonics 11y ago
Will you still think that when you realize it isn't actually a quicksort?
- eru 11y agoIt's tree sort. It does the same comparisons as quicksort, but organizes its data differently. It's nifty, but not an especially beautiful use of Haskell. Okasaki's Red-Black Trees rendered in Haskell are nicer, for example.