The document describes insertion sort. It has N-1 passes where each pass ensures the elements from position 0 to that position are sorted. It moves the element at each position left until it reaches its correct sorted position among the first few elements. The algorithm has O(n2) time complexity. Pseudocode and C code are provided to implement the algorithm.