##选择排序法
#include<stdio.h>
void fun (int *str, int len)
{
for (int i = 0; i < len-1; i++)//比较len-1次
{
for (int j = i+1; j < len; j++)//每次比较完后从下一个进行下一次比较
{
if (str[i] > str[j])
{
int temp = str[j];
str[j] = str[i];
str[i] = temp;
}
}
}
for (int i = 0; i < len; i++)
{
printf("%d",str[i]);
}
}
int main()
{
int len;
int str[] = { 1,5,6,2,3,4,8,9,7 };
len = sizeof(str) / sizeof(str[0]);
fun(str, len);
}