Pseudo Code:

 mark the first element as sorted

 for each unsorted element X

  extract the element X

  for j = last sorted index down to 0

   if current element j > element X

    move current element right by 1 index

   else

    break loop and insert element X here