Insertion Sort

for each i from 1 to size-1  
  j = i  
  item = list[j]  
  while j > 0 and list[j-1] > item  
    list[j] = list[j-1];  
    j--;  
  list[j] = item

The worst-case runtime is $O(n^2)$. It iterates over elements in a list, and for each element, iteratively compares it to its predecessors and inserts it into its correct position among them

FOR EACH i FROM 1 TO size - 1
    SET j TO i
    SET item TO list[j]
    WHILE j > 0 AND list[j - 1] > item
        SET list[j] TO list[j - 1]
        DECREMENT j BY 1
    END WHILE
    SET list[j] TO item
END FOR