排序练习

import java.util.Arrays;

public class HeapSort {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int arr[]={2,4,5,1,0,3,9,8,7,6};
		
		//Swap(arr,0,1);
		//BuddleSort(arr);
		//InsertSort(arr);
		//SelectSort(arr);
		
		System.out.println(Arrays.toString(arr));
		
	}
	/***
	 * maopao
	 * @param arr
	 */
	public static void BuddleSort(int[] arr){
		for (int i = 0; i < arr.length-1; i++) {
			for (int j = 0; j < arr.length-1-i; j++) {
				if(arr[j]>arr[j+1]){
					Swap(arr,j,j+1);
				}
			}
		}
		
		
	}
	
	/***
	 * charu
	 */
	public static void InsertSort(int arr[]){
		for (int i = 1; i < arr.length; i++) {
			int j=i;
			while(j>=1&&arr[j]<arr[j-1]){
				Swap(arr,j,j-1);
				j--;
				
			}
		}
		
	}
	/***
	 * xuanze
	 */
	public static void SelectSort(int arr[]){
		for (int i = 0; i < arr.length-1; i++) {
			int min=i;
			//找到最小数的下标
			for (int j = i+1; j < arr.length; j++) {
				if(arr[min]>arr[j]){
					min=j;
				}
			}
			if(min!=i){
				Swap(arr,min,i);
			}
			
		}
		
		
	}
	
	/***
	 * jiaohuan
	 * @param arr
	 * @param i
	 * @param j
	 */
	public static void Swap(int arr[],int i,int j){
		arr[i]=arr[i]+arr[j];
		arr[j]=arr[i]-arr[j];
		arr[i]=arr[i]-arr[j];
		
	}
	
	
	
}