Insertion Sort

how to implement insertion sort, why it outperforms complex algorithms on small or nearly-sorted data, and why real libraries still use it