冒泡排序之排序
#include<stdio.h>
#include<stdlib.h>
int main()
{
#define N 10
int a[N] = { 3, 5, 18, 9, 23, 5, 2, 1, 0, 2 };
for (int i = 0; i < N - 1;i++)
{
for (int j = 0; j < N - 1 - i;j++)
{
if (a[j]>a[j+1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
for (int i = 0; i < N; i++)
{
printf("%d ", a[i]);
}
printf("\n");
}
}
# include <stdio.h>
void sort(int * a, int len)
{
int i, j, t;
for (i=0; i<len-1; ++i)
{
for (j=0; j<len-1-i; ++j)
{
if (a[j] > a[j+1])
{
t = a[j];
a[j] = a[j+1];
a[j+1] = t;
}
}
}
}
int main(void)
{
int a[6] = {10, 2, 8, -8, 11, 0};
int i = 0;
sort(a, 6);
for (i=0; i<6; ++i)
{
printf("%d ", a[i]);
}
printf("\n");
return 0;
}