C++ "sort"

[SteelCurtain]

I wouldn't say it's stealing to continue someone's work. People who discovered an efficient algorithm don't own those algorithms, they existed before they were discovered in the same sense that the Pythagorean theorem existed before it was discovered: it exists in our world (and any world which approximately obeys the Euclidean Fifth Postulate) independently of whether it's discovered or not. And efficient sorting algorithms exist in all worlds in which a RAM machine is possible.
What do you mean you don't like Introsort? It's demonstrably the most efficient known algorithm for sorting large arrays that doesn't make assumptions about whether they are already partially or completely sorted.

Try writing SQL at the command line. Then get back to me.

I have no interest in doing your first year homework vicariously.

Lol try writing SQL from the command line? As your example of something more complicated than implementing and understanding the limiting behavior of sorting algorithms?

You, sir, are just a shitty troll.

---

@FlatAssembler

Understanding some of the more complicated sorting algorithms will help you in application development more by the means of understanding than the understanding itself. I am a Senior Developer with a medium sized data manipulation company. While my experience isn't exactly typical, I have used sorting a handful of times---and I have used built in/library functions every time. However, I can't tell you how valuable and worthwhile the time and knowledge was and is learning stuff like Big O notation and the memory organization and stack/heap use when learning in my algorithms class. That stuff is way more valuable, imo.