#include <stdio.h>
#include <stdlib.h>
//int data[] = {5,2,1,3,4};
int data[] = {2,4,6,5,3,1,0};
//int data[] = {0,1,2,3,4,5};
//int data[] = {6,5,4,3,2,1,0};
int bubble_sort(int data[],int n)
{
int temp;
int i, j, exchanged=1;
for(i=1; exchanged && i<n; i++)
{
exchanged=0;
for(j=0; j<n-i; j++)
{
if(data[j] > data[j+1])
{
temp = data[j];
data[j] = data[j+1];
data[j+1] = temp;
exchanged=1;
}
}
}
return 0;
}
#define NMEMB(x) (sizeof(x)/sizeof(x[0]))
int main(void)
{
int i;
for(i=0; i< NMEMB(data); i++)
{
printf("%3d",data[i]);
}
printf("\n");
bubble_sort( data, NMEMB(data));
for(i=0; i< NMEMB(data); i++)
{
printf("%3d",data[i]);
}
printf("\n");
return 0;
}
冒泡排序
最新推荐文章于 2022-04-29 23:24:15 发布