Re:Big-O Algorithm Complexity Cheat Sheet
by pbiggar on Saturday May 04, 2013 @01:50PM
(#5655651)
When reading it, I felt that red was "don't use in production", green was "fine to use in production" and yellow was "maybe use in production".
[ Parent
| on HN ]
Except insertion sort is faster than quicksort for smaller N because of the overhead involved in quicksort - quicksort has large constants which big-O notation isn't designed to show. This is why many library sorting algorithms fall back to insertion once the things you are sorting gets small enough.