准备学习一下各种算法,而下图是来自维基百科,关于算法的分类。,好吧,有很多算法之前从未听过。
这篇做为开头吧,不定期的将自己的学习进行一下总结。
冒泡排序,应该算是一种最简单的排序算法,应该都在学校课本上学习过。
定义:它重复地走访过要排序的数列,一次比较两个元素,如果他们的顺序错误就把他们交换过来。走访数列的工作是重复地进行直到没有再需要交换,也就是说该数列已经排序完成。这个算法的名字由来是因为越小的元素会经由交换慢慢“浮”到数列的顶端。(https://zh.wikipedia.org/wiki/%E5%86%92%E6%B3%A1%E6%8E%92%E5%BA%8F)
Java语言实现:
int[] arrays = {22, 34, 32, 82, 55, 89, 50, 37, 5, 3};
System.out.println("y: " + Arrays.toString(arrays));
int size = arrays.length;
for (int i = 0; i < size - 1; ++i) {
for (int j = 0; j < size - 1 - i; ++j) {
if (arrays[j] > arrays[j + 1]) {
int tmp = arrays[j + 1];
arrays[j + 1] = arrays[j];
arrays[j] = tmp;
}
}
System.out.println(i + ": " + Arrays.toString(arrays));
}
结果如下:
y: [22, 34, 32, 82, 55, 89, 50, 37, 5, 3]
0: [22, 32, 34, 55, 82, 50, 37, 5, 3, 89]
1: [22, 32, 34, 55, 50, 37, 5, 3, 82, 89]
2: [22, 32, 34, 50, 37, 5, 3, 55, 82, 89]
3: [22, 32, 34, 37, 5, 3, 50, 55, 82, 89]
4: [22, 32, 34, 5, 3, 37, 50, 55, 82, 89]
5: [22, 32, 5, 3, 34, 37, 50, 55, 82, 89]
6: [22, 5, 3, 32, 34, 37, 50, 55, 82, 89]
7: [5, 3, 22, 32, 34, 37, 50, 55, 82, 89]
8: [3, 5, 22, 32, 34, 37, 50, 55, 82, 89]
可以看到,每次都会将最大的数值排到最后一个。如果最小的恰好在数组的最后一位,则最后一次才将顺序排好。
当然,还有另一种写法,就是将最小的排到最后,只需要将
if (arrays[j] > arrays[j + 1])
改为:
if (arrays[j] < arrays[j + 1])
如果改为 <,则排序结果如下:
y: [22, 34, 32, 82, 55, 89, 50, 37, 5, 3]
0: [34, 32, 82, 55, 89, 50, 37, 22, 5, 3]
1: [34, 82, 55, 89, 50, 37, 32, 22, 5, 3]
2: [82, 55, 89, 50, 37, 34, 32, 22, 5, 3]
3: [82, 89, 55, 50, 37, 34, 32, 22, 5, 3]
4: [89, 82, 55, 50, 37, 34, 32, 22, 5, 3]
5: [89, 82, 55, 50, 37, 34, 32, 22, 5, 3]
6: [89, 82, 55, 50, 37, 34, 32, 22, 5, 3]
7: [89, 82, 55, 50, 37, 34, 32, 22, 5, 3]
8: [89, 82, 55, 50, 37, 34, 32, 22, 5, 3]
从结果中发现,从4开始,已经排好序了,白白浪费了几次循环比较。
因此,算法有必要再优化一下:
int[] arrays = {22, 34, 32, 82, 55, 89, 50, 37, 5, 3};
System.out.println("y: " + Arrays.toString(arrays));
int size = arrays.length;
for (int i = 0; i < size - 1; ++i) {
boolean flag = false;
for (int j = 0; j < size - 1 - i; ++j) {
if (arrays[j] < arrays[j + 1]) {
int tmp = arrays[j + 1];
arrays[j + 1] = arrays[j];
arrays[j] = tmp;
flag = true;
}
}
if (!flag){
break;
}
System.out.println(i + ": " + Arrays.toString(arrays));
}
优化后的排序结果如下:
y: [22, 34, 32, 82, 55, 89, 50, 37, 5, 3]
0: [34, 32, 82, 55, 89, 50, 37, 22, 5, 3]
1: [34, 82, 55, 89, 50, 37, 32, 22, 5, 3]
2: [82, 55, 89, 50, 37, 34, 32, 22, 5, 3]
3: [82, 89, 55, 50, 37, 34, 32, 22, 5, 3]
4: [89, 82, 55, 50, 37, 34, 32, 22, 5, 3]
可以看到,比之前少了几次循环比较。