排序算法

int abc[10] = { 190, 222, 123, 234, 477, 10, 783, 489, 3234, 297 };

1、选择排序
void select_sort(int a[], int n)
{
int j;
for (int i = 0; i < n - 1; i++) {
j = i;
for (int k = i + 1; k < n; k++) {
if (a[k] < a[j])
j = k;

}
if (j != i) {
int temp;
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}

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


}

2、冒泡排序
void  bubble_sort(int a[], int n)
{
int temp;
int change = 1;
for (int i = n-1; i > 1 && change; i--) {
change = 0;
for (int j = 0; j < i; j++) {
if (a[j] > a[j+1]) {
temp = a[j];
a[j] = a[j+1];
a[j + 1] = temp;
change = 1;
}
}
}
for (int m = 0; m < n; m++) {
printf("%d\n", a[m]);
}
}


int main()
{
//select_sort(abc, 10);


bubble_sort(abc, 10);
    return 0;
}