Treesort, or how I learned to keep trying and avoid Google
Nicolás Siplis

There are two pieces of advice of the same value: “never do your own X” and “do your own X”. Of course putting your own sorting (or hash tables, or strings, or memory allocators) in production grade code is hardly the right thing to do. But reinventing something is simply the best way to gain expertise about it.

I’m pretty sure there are people who iterate over an ordered tree, put elements into array of some sort and then run a standard sort on it only because that’s the most googlable thing to do.

Like what you read? Give Oleksandr Kaleniuk a round of applause.

From a quick cheer to a standing ovation, clap to show how much you enjoyed this story.