News for hackers. Stuff that matters.
Re:Big-O Algorithm Complexity Cheat Sheet by sbov on Saturday May 04, 2013 @02:18PM (#5655765)
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.
Re:Big-O Algorithm Complexity Cheat Sheet by pbiggar on Saturday May 04, 2013 @02:30PM (#5655808)
All "don't use in production" tags should be accompanied by "unless you really know what you're doing".