数据结构之冒泡排序

#include <stdio.h>

#define SIZE 10
unsigned int array[SIZE]={1,2,3,5,4,6,9,8,7};

void sort(unsigned int *a,unsigned int num)
{
    unsigned int i,j;
    unsigned int temp;
    for(i=0;i<num-1;i++)
    {
        for(j=0;j<num-1-i;j++)
        {
            if(array[j] > a[j+1])
            {
                temp = array[j];
                array[j] = a[j+1];
                array[j+1] = temp;
            }
        }
    }

}
void print(void)
{
    unsigned int i;
    for(i=0;i<SIZE;i++)
    {
        printf("array[i] = %d\n",array[i]);
    }
}

int main(void)
{
    sort(array,SIZE);
    print();
    return 0;
}

运行结果如下：

array[i] = 0
array[i] = 1
array[i] = 2
array[i] = 3
array[i] = 4
array[i] = 5
array[i] = 6
array[i] = 7
array[i] = 8
array[i] = 9