冒泡排序

今天自己动手写了一下冒泡排序，自己动手丰衣足食

#include <stdio.h>#define N 9int BubbleSort(int sort[]);int swap(int *a, int *b);int main(){    int i,j;    int sort[N] = {9,8,7,6,5,4,3,2,1};    for (i = 0; i < N; i++)    {        printf("%d ",sort[i]);    }    printf("\n");    BubbleSort(sort);        for (i = 0; i < N; i++)    {        printf("%d ",sort[i]);    }    printf("\n");    return 0;}int BubbleSort(int sort[]){    int i,j;    int temp;    for (i = 0; i < N; i++)    {        for ( j = 0; j < N-i-1; j++)        {            if (sort[j+1] < sort[j])            {                swap(&sort[j+1],&sort[j]);            }        }    }}int swap(int *a, int *b){    int temp;    temp = *a;    *a = *b;    *b = temp;}

大家一起努力