[算法练习] 冒泡排序

]#include <stdio.h>
#define MAX_LEN 10
void sort(int numbers[])
{
int i, j, temp;
for (i = 0; i < MAX_LEN - 1; i++)
for (j = 0; j < MAX_LEN - i - 1; j++)
if (numbers[j] > numbers[j+1]) {
temp = numbers[j];
numbers[j] = numbers[j+1];
numbers[j+1] = temp;
}
}
int main(void)
{
int numbers[MAX_LEN];
int i;
for (i = 0; i < MAX_LEN; i++)
scanf("%d", &numbers[i]);
sort(numbers);
for (i = 0; i < MAX_LEN; i++)
printf("%-4d ", numbers[i]);
printf("/n");
return 0;
}