基本算法的java实现

private static void  insertSort(int[] a){
		for(int i=1;i<a.length;i++){
			int j= i-1;
			while(j>=0 && a[j] > a[j+1]){
				int temp = a[j+1];
				a[j+1] = a[j];
				a[j] = temp;
				j--;
			}
		}
	}

private static int partion(int[] a,int low,int high){
		int temp = a[low];
		while(low < high){
		while(low < high && a[high] >= temp)
			high --;
		a[low] = a[high];
		while(low < high && a[low] <= temp)
			low++;
		a[high] = a[low];
		}
		a[low] = temp;
		return low;
	}
	private static void qiuckSort(int[] a,int low,int high){
		if(low < high){
			int temp = partion(a, low, high);
			qiuckSort(a, low, temp-1);
			qiuckSort(a, temp+1, high);
			
		}
	}

private static void bubbleSort(int[] a){
		for(int i = 0;i<a.length-1 ;i++){
			for(int j=0;j<a.length-1-i;j++){
				if(a[j] > a[j+1]){
					int temp = a[j];
					a[j] = a[j+1];
					a[j+1] = temp;
				}
			}
		}
	}

private static void selectSort(int[] a){
		for(int i=0;i<a.length-1;i++){
			int min = a[i];
			int minIndex=i;
			for(int j= i;j<a.length;j++){
				if(a[j] < min){
					min = a[j];
					minIndex = j;
				}
			}
			a[minIndex] = a[i];
			a[i] = min;
		}
	}