//冒泡排序
BUBBLE_SORT(A)
{
for i = length[A] to 2
{
for j = 1 to i-1
{
if A[j] > A[j+1]
{
exchange A[j] and A[j+1];
}
}
}
}
@Test
public void sort2() {
Integer arr[] = { 8, 5, 10, 12, 7, 6, 15, 9, 11, 3 };
for (int h = 0; h < arr.length; h++) {//共进行n-1趟外排序
for (int k = h+1; k < arr.length ; k++) {//每趟内排序所比较的个数分别为:n\n-1\n-2\...\3\2
if (arr[h] > arr[k]) {
Integer temp = arr[h];
arr[h] = arr[k];
arr[k] = temp;
}
}
}
// 输出数组元素
for (Integer it : arr) {
System.out.print(it + " ");
}
}
3 5 6 7 8 9 10 11 12 15