编辑代码

#include <stdio.h>

int insertSort(int arr[], int len) {
	if (len < 0)
		return -1;
		
	int i = 1;
	for (; i < len; ++i) {
		int key = arr[i];
		int j = i - 1;
		while (j>=0 && arr[j] > key) {
			arr[j + 1] = arr[j];
			j--;
		}
		arr[j + 1] = key;
	}
	
	return 0;
}


int main() {
	int arr[] = {3, 1, 4, 1, 5, 9, 2, 6, 5};
	printf("%d\n", insertSort(arr, 9));
	int i = 0;
	for (; i<9; i++) printf("%d ", arr[i]);
	return 0;
}