C语言实现选择排序算法

#include <stdio.h>

void selectionSort(int arr\[\], int n) {

int i, j, min_idx;

for (i = 0; i < n - 1; i++) {

// 找到未排序部分的最小值

min_idx = i;

for (j = i + 1; j < n; j++)

if (arrj < arrmin_idx)

min_idx = j;

// 交换找到的最小值到正确的位置

int temp = arrmin_idx;

arrmin_idx = arri;

arri = temp;

}

}

// 主函数用于测试

int main() {

int arr\[\] = {64, 25, 12, 22, 11};

int n = sizeof(arr) / sizeof(arr0);

selectionSort(arr, n);

printf("Sorted array: \n");

for (int i = 0; i < n; i++)

printf("%d ", arri);

printf("\n");

return 0;

}