/insertion_sort_patika

Insertion Sort

[www.patika.dev]

[22,27,16,2,18,6] :

  1. [2,27,16,22,18,6]
  2. [2,6,16,22,18,27]
  3. [2,6,16,18,22,27]

Big-O Notation

n(n+1)/2 O(n^2)

Time Complexity

Average case: The number we are searching is in the middle. Worst case: The number we are searching is at the end. Best case: The number we are searching is at the start.

[7,3,5,8,2,9,4,15,6] First 4 steps of this arrays insertion sort :

  1. [2,3,5,8,7,9,4,15,6]
  2. [2,3,4,8,7,9,5,15,6]
  3. [2,3,4,5,7,9,8,15,6]
  4. [2,3,4,5,6,9,8,15,7]