java冒泡排序整理

package program;


public class TestSort {
//冒泡排序原理：当前数值和下一个数值比较，如果如果符合条件就交换位置[通过数组下标]
public static void main(String[] args){
int[] array = {3,1,9,-5,2,10,6};
for(int i=0;i<array.length-1;i++){
for(int j=0;j<array.length-1;j++){
if(array[j] < array[j+1]){
int temp = array[j];  //交换位置
array[j] = array[j+1];
array[j+1] = temp; 
}
}
}
for(int x=0;x<array.length;x++){
System.out.println(array[x]);
}
}

}

{3,1,9,-5,2,10,6}

//循环简单实例[i==0时]
{3,1,9,-5,2,10,6} 0 
{3,9,1,-5,2,10,6} 1
{3,9,1,-5,2,10,6} 2 
{3,9,1,2,-5,10,6} 3
{3,9,1,2,10,-5,6} 4
{3,9,1,2,10,6,-5} 5