版本一:
马上更新。。。。请等待。
版本二:
//冒泡排序
//杨鑫
#include <stdio.h>
#include <stdlib.h>
void BubbleSort(int a[], int length)
{
int j = 0, i = 0, temp = 0;
for(i = 0; i < length; i++)
{
for(j = i + 1; j < length; j++)
{
if(a[i] > a[j])
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
}
int main()
{
int k = 0;
int X[7] = {22, 11, 5, 666, 3, 6, 8};
printf("===============================\n\n");
printf("要排序的数列是:\n 22 11 5 666 3 6 8\n");
BubbleSort(X, 7);
printf("排序后的结果是:\n");
for(k = 0; k < 7; k++)
{
printf(" %d ", X[k]);
}
printf("\n\n==================&