代码实现
#include <stdio.h>
#include <stdlib.h>
void insertSort(int arr[], int len)
{
int i = 0, j = 0;
for (i = 1; i < len;i++) {
if (arr[i]<arr[i-1]) {
int temp = arr[i];
for (j = i - 1; j >= 0 && temp < arr[j];j--) {
arr[j + 1] = arr[j];
}
arr[j + 1] = temp;
}
}
}
int main(int argc, char* argv[])
{
int arr[] = { 5, 8, 1, 6, 3, 4, 2, 7 };
int len = sizeof(arr) / sizeof(int);
insertSort(arr, len);
for (int i = 0; i < len;++i) {
printf("%d, ", arr[i]);
}
return 0;
}