选择排序

#include<stdio.h>
#include<stdlib.h>

#include<time.h>

#define NUM 10

void selectSort(int arr[], int n)
{
int tmp = 0;
for (int i = 0; i < n - 1; i++)
{
for (int j = i + 1; j < n; j++)
{
if (arr[i] > arr[j])
{
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
}
}
}


void printA(int a[], int n)
{
for (int i = 0; i < n; i++)
{
printf("%3d", a[i]);
}
printf("\n");
}


int main()
{
int a[NUM];
srand(time(0));
for (int i = 0; i < NUM; i++)
{
a[i] = rand() % 99 + 1;
}
printf("原始数据:\n");
printA(a, NUM);
selectSort(a, NUM);
printf("冒泡排序后的数据:\n");
printA(a, NUM);
system("pause");
return 0;

}

运行结果: