关于直接选择排序的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 (arr[j] < arr[min_idx])
min_idx = j;
if(min_idx!=i)
{
int temp = arr[min_idx];
arr[min_idx] = arr[i];
arr[i] = temp;
}
}
}
int main() {
int arr[] = {4,3,2,7,4,8,9,1};
int n = sizeof(arr)/sizeof(arr[0]);
selectionSort(arr, n);
printf("Sorted array: \n");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
return 0;
}
这是有一次上课时老师讲的一个,可以看成是上面这个代码的优化版:
#include <stdio.h>
void selectionSort(int arr[], int n) {
int i, j, min_idx;
for (i = 0; i<=n-2; i++) {
min_idx = i;
for (j = i+1; j<=n-1; j++)
if (arr[j] < arr[min_idx])
min_idx = j;
if(min_idx!=i)
{
int temp = arr[min_idx];
arr[min_idx] = arr[i];
arr[i] = temp;
}
}
}
int main() {
int arr[] = {4,3,2,7,4,8,9,1};
int n = sizeof(arr)/sizeof(arr[0]);
selectionSort(arr, n);
printf("Sorted array: \n");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
return 0;
}
在此抛砖引玉,让大家一起讨论一下这两个代码的区别。并且为什么第一个代码的出现率要远比第二个高