Insertion Sort

• Assume initial sequence a[0] . . . a[k] is sorted (k = 0):

  11

  9

  16

  5

  7

• Add a[1]; element needs to be inserted before 11

  9

  11

  16

  5

  7

• Add a[2]

  9

  11

  16

  5

  7

• Add a[3]

  5

  9

  11

  16

  7

• Finally, add a[4]

  5

  9

  11

  16

  7