排序算法java

package com.jiangshuai.test;

public class paixu {
	public static void main(String[] args){
		int[] aa = {1,2,34,12,76,0,22};
		maopao(aa);
		System.out.println(aa[0]);
	}
	private static void maopao(int[] data){
		for(int i=0;i<data.length-1;i++){
			for(int j=0;j<data.length-i-1;j++){
				if(data[j]<data[i]){
					swap(data,i,j);
				}
			}
		}
	}
	private static void swap(int[] data,int i,int j){
		int temp = data[i];
		data[i] = data[j];
		data[j] = temp;
	}
	
	private static void kuaipai(int[] data,int low,int high){
		if(low<high){
			int midpos = paration(data,low,high);
			kuaipai(data,low,midpos);
			kuaipai(data,midpos,high);
		}

	}
	private static int paration(int[] data,int low,int high){
		int key = data[low];
			while(high>low){
				while(low<high&&key < data[high]){
					--high;
				}
				swap(data,low,high);
				while(low<high && data[low] < key){
					++low;
				}
				swap(data,low,high);
			}
		return low;
	}
	
	
	//插入排序
	private void choiceAssort(int[] data){
		if(data == null){
			return;
		}
		for(int i=0;i<data.length-1;i++){
			int min = data[i];
			for(int j=0;j<data.length;j++){
				if(min > data[j]){
					swap(data,min,j);
				}
			}
		}
	}
	
	
	
	//插入排序
	private void insertAssort(int[] data){
		if(data == null && data.length == 0){
			return;
		}
		for(int i=1;i<data.length;i++){
			int key = data[i];
			int j = i;
			while(j>0 && key < data[j-1]){
				data[j] = data[j-1];
				j--;
			}
			data[j] = key;
		}
	}
	
	
	
	
	
	
	
	
	
	
	
}