java面试经典算法之冒泡排序和快速排序(快排)

package com.aograph.controller;

public class MyTest {

	public static void main(String[] args) {
		//BubbleSort2();
		int[] arr = {6,3,8,2,9,1};
		quickSort(arr,0,arr.length-1);
		for (int a: arr) {
			System.out.println(a);
		}
	}
	
	private static void quickSort(int[] arr,int low,int high) {
		int i,j,temp,t;
		if (low > high) return;
		i = low;
		j = high;
		//temp 就是基准位
		temp = arr[low];
		
		while (i < j) {
			//先看右边,依次往左递减
			while (temp<=arr[j] && i=arr[i]&&i arr[j+1]) {
					int temp = arr[j];
					arr[j] = arr[j+1];
					arr[j+1] = temp;
					flag = true;
				}
			}
			if (!flag) {
				break;
			}
		}
		for (int a: arr) {
			System.out.println(a);
		}
	}
	
	private static void BubbleSort() {
		int[] arr = {6,3,8,2,9,1};
		for (int i=0;i arr[j+1]) {
					int temp = arr[j];
					arr[j] = arr[j+1];
					arr[j+1] = temp;
				}
			}
		}
		for (int a: arr) {
			System.out.println(a);
		}
	}
	
}