#include <stdio.h>
void insertionSort(int arr[], int n) {
int i, key, j;
for (i = 1; i < n; i++) {
key = arr[i];
j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}
int main() {
int myArray[] = {9, 4, 6, 2, 7, 3, 1};
int arrayLength = sizeof(myArray) / sizeof(myArray[0]);
insertionSort(myArray, arrayLength);
printf("排序后的数组:");
for (int i = 0; i < arrayLength; i++) {
printf("%d ", myArray[i]);
}
return 0;
}