1
void
insertion_sort(
int
*
arr,
int
size)
2 {
3 int i = 0 , j = 0 ;
4 for (i = 1 ; i < size; ++ i)
5 {
6 int tmp = arr[i];
7 for (j = i; j > 0 && tmp < arr[j - 1 ]; -- j)
8 {
9 arr[j] = arr[j - 1 ];
10 }
11 arr[j] = tmp;
12 }
13 }
2 {
3 int i = 0 , j = 0 ;
4 for (i = 1 ; i < size; ++ i)
5 {
6 int tmp = arr[i];
7 for (j = i; j > 0 && tmp < arr[j - 1 ]; -- j)
8 {
9 arr[j] = arr[j - 1 ];
10 }
11 arr[j] = tmp;
12 }
13 }