编辑代码

#include <stdio.h>

void selectionSort(int arr[], int n) {
    int i, j, minIndex, temp;
    for (i = 0; i < n-1; i++) {
        minIndex = i;
        for (j = i+1; j < n; j++) {
            if (arr[j] < arr[minIndex]) {
                minIndex = j;
            }
        }
        // 交换arr[i]和arr[minIndex]
        temp = arr[i];
        arr[i] = arr[minIndex];
        arr[minIndex] = temp;
        
        // 打印每轮排序后的关键字状态
        printf("第 %d 轮排序后的关键字状态:", i+1);
        for (int k = 0; k < n; k++) {
            printf("%d ", arr[k]);
        }
        printf("\n");
    }
}

int main() {
    int K[] = {11, 9, 3, 20, 56, 32};
    int n = sizeof(K) / sizeof(K[0]);
  
    printf("初始关键字状态:");
    for (int i = 0; i < n; i++) {
        printf("%d ", K[i]);
    }
    printf("\n\n");
  
    selectionSort(K, n);
  
    printf("\n排序后的关键字状态:");
    for (int i = 0; i < n; i++) {
        printf("%d ", K[i]);
    }
    printf("\n");
  
    return 0;
}