排序之冒泡排序

View Code

 1 #include <stdio.h>
 2 #define OK 1
 3 int BubbleSort(int *a,int length);
 4 int main()
 5 {
 6     int a[9] = {5,8,7,36,54,21,2,3,19};
 7     BubbleSort(a,9);
 8     for(int i = 0;i < 9;i++)
 9     {
10         printf("%d ",a[i]);
11     }
12     printf("\n");
13     return 0;
14 }
15 
16 int BubbleSort(int *a,int length)
17 {
18     int temp;
19     for(int i = 1;i < length;++i)
20     {
21         for(int j = 0;j < length-i;++j)
22         {
23             if(a[j] > a[j+1]) 
24             {
25                 temp = a[j];
26                 a[j] = a[j+1];
27                 a[j+1] = temp;
28             }
29         }
30     }
31     return OK;
32 }

 

转载于:https://www.cnblogs.com/liuweilinlin/archive/2012/09/08/2676644.html