Insertion sort is a method that sorts an array by taking each element in order from the front, comparing it with the already sorted portion of the array, and inserting it into its correct position.

For example, given the sequence {5, 4, 3, 7, 6}, the insertion sort process is as follows:

Initially, the first value 5 has nothing in front of it, so it is considered sorted.
From the second element 4 onward, each element is inserted into its correct position in the already sorted part.
Note: In the third step, 7 is larger than the previous sorted portion 3 4 5, so it remains in its place.

#1158 upload 5543 done 3359 how_to_reg 2936

Insertion Sort timer 1s memory 32MB

#1158

Insertion Sort 1s 32MB