java入门--冒泡排序算法

冒泡排序算法

排序要点：相邻原先进行比较，符合规则就交换值;

示例代码:

/*冒泡排序算法*/

class Demo7

{

public static void main(String[] args)

{

int[] arr = {-9,20,12,-18,23,10,-4};

bubbleSort(arr);}

public static void bubbleSort(int[] arr)

{

for (int i = 0; i < arr.length; i++)

{

for (int j = 0; jarr[j+1])

{

int temp = arr[j];

arr[j] = arr[j+1];

arr[j+1] = temp;

}

}

}

for (int i = 0; i < arr.length; i++)

{

System.out.print(arr[i]+",");

}

}

}

示例代码截图: