Skip to main content
Post Made Community Wiki
Source Link
Oliver Weiler
  • 2.4k
  • 19
  • 28

Insertion Sort

Easy to implement, very fast on small lists and used in Merge Sort / Quicksort implementations to speed them up. It's stable, and operates in O(n) on sorted lists (when sorted in ascending order).