冒泡排序

#include <stdio.h>


void BubbleSort(int array[], int len)
{
int i, j;
int temp;


for (i = 0; i < len -1; ++i)
{
for (j = len - 1; j > i; --j)
{
if (array[j] < array[j - 1])
{
temp = array[j];
array[j] = array[j - 1];
array[j - 1] = temp;
}
}
}
}


int main()
{
int i = 0;
int a[] = {29, 18, 87, 56, 3, 27};
int length = sizeof(a) / sizeof(a[0]);


BubbleSort(a, length);


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


return 0;
}