- (void)insertSort {
/*插入排序(类似玩纸牌)左边是有序的,右边是无序的,然后取无序的插入到左边的有序中
*/
int array[10] = {5, 27, 15, 19, 20, 44, 66, 14, 95, 63};
int num = 10;
int i,j;
for (i = 1; i < num - 1; i ++) {
int temp = array[i];
for (j = i - 1; j >= 0; j --) {
if (temp > array[j]) {
break;
}
array[j + 1] = array[j];
}
array[j + 1] = temp;
}
for (int k = 0; k < num ; k ++) {
printf("%d ", array[k]);
}
}