void bubble_sort(int *array,int length)
{
int temp;
for(int i = 0;i < length-1 ; i++)
for(int j = 0;j< length-1-i ;j++)
{
if(array[j] > array[j+1]
{
temp = array[j];
array[j] = array[j+1];
array[j+1] = temp ;
}
}
}
//共需length-1大趟比较
//内部的比较次数为length-1-i//大的元素向上冒!