冒泡排序与归并排序
冒泡排序
- 方法一:思想是相邻元素逐个比较,然后将最大的放在后面。每遍历完一次,就会有一个元素就位,所以时间复杂度为O(n^2)
<pre>
public class LinearRecur {
public static void main(String[] args) {
int[] b = {
7,6,10,9,12,15};
int low = 0;
int high = b.length;
int index = 0;
bubbleSort(b, low, high);
for (int i = 0; i < b.length; i++) {
System.out.println(b[i]);
}
}
public static void bubbleSort(int[] array, int low, int high) {
while (low < high--) {
for (int i = 0; i < high; i++) {
if (array[i+1] < array[i]) {
array[i] = array[i+1] + array[i];
array[i+1]= array[i] - array[i+1];
array[i] = array[i] - array[i+1];