[prev] 39 [next]

Summary of Elementary Sorts

Comparison of sorting algorithms (online)

  #compares #swaps #moves
  minavgmax minavgmax minavgmax
Selection sort n2 n2n2 n nn ...
Bubble sort n n2n2 0 n2n2 ...
Insertion sort n n2n2 ... n n2n2
Shell sort n n4/3n4/3 ... 1 n4/3n4/3

Which is best?

  • depends on cost of compare vs swap vs move for Items
  • depends on likelihood of average vs worst case