#pragma once
#include<stdio.h>
//直接插入排序1
void InsertSort1(int array[], int size){
for (int i = 0; i < size; i++){
int key=array[i];
int j;
//[i-1,0]
for (j = i - 1; j >= 0; j--){
if (array[j] <= key){
break;
}
array[j + 1] = array[j];
}
array[j + 1] = key;
}
}
//直接插入排序2
void InsertSort2(int array[], int size){
for (int i = 0; i < size; i++){
int pos = i;
for (int j = 0; j <= i - 1; j++){
if (array[j]>array[i]){
pos = j;
break;
}
}
if (pos != i){
int key = array[i];
for (int k = i; k > pos; k--){
array[k] = array[k - 1];
}
array[pos] = key;
}
}
}
void PrintArray(int array[], int size){
for (int i = 0; i < size; i++){
printf("%d ", array[i]);
}
printf("\n");
}
void test(){
int array[] = { 3, 9, 1, 4, 7, 5, 2, 8, 0 ,10, 9 };
int size = sizeof(array) / sizeof(int);
PrintArray(array, size);
InsertSort1(array, size);
InsertSort2(array, size);
PrintArray(array, size);
}
结果:
3 9 1 4 7 5 2 8 0 10 9
0 1 2 3 4 5 7 8 9 9 10
0 1 2 3 4 5 7 8 9 9 10
请按任意键继续. . .