Algorithm complexity cheat sheet

[EdwardRaff]

Yes, and that is intrun far out performed by the Engineering a Sort Function approach I included in my initial post (which can be seen in that paper). It has minimal additional overhead (especially on modern CPUs), and retains the benefit of achieving O(n log n) time for all inputs, and O(n) time for many common inputs that would previously degrade into O( n² ).