冒泡排序-排序算法

 1 void bubbleSort(int * array,int length)
 2 {
 3     int i,j,temp;
 4     for(i = 0;i < length-1;i++)
 5     {
 6         for(j = 0;j < length-i-1;j++)
 7         {
 8             if(array[j] > array[j+1])
 9             {
10                 temp = array[j];
11                 array[j] = array[j+1];
12                 array[j+1] = temp;
13             }
14         }
15     }
16     
17 }

 1 void bubbleSort2(int * array,int length)
 2 {
 3     int i,j,temp;
 4     for(i = length-1;i > 0;i--)
 5     {
 6         for(j = 0;j < i;j++)
 7         {
 8             if(array[j] > array[j+1])
 9             {
10                 temp = array[j];
11                 array[j] = array[j+1];
12                 array[j+1] = temp;
13             
14             }
15         }
16     }
17 }