package com.org.arrays.sort;

//选择排序法
public class TestCheck {

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		int [] ary = {-1,-3,5,7,9,2,4,6,8,10};
		System.out.print("整数排序前：");     
		for(int ar:ary){
			System.out.print(ar+"\t");
		}
		System.out.println();
		selectSort(ary);
		System.out.print("整数排序后：");
		for(int a:ary){
			System.out.print(a+"\t");
		}
		
	}

	 /** 冒泡排序方法  */    
	/*private static void displayIntArr(int[] arr) {

		for(int i=arr.length-1;i>0;i--){
			for(int j=0;j<i;j++){
				if(arr[j]>arr[j+1]){
					int temp;
					temp = arr[j];
					arr[j] = arr[j+1];
					arr[j+1] = temp;
				}
			}
		}
	}*/
	
	/** 选择排序 */
    public static int[] selectSort(int[] ary) {
        for (int i = 0; i < ary.length - 1; i++) {
              for (int j = i + 1; j < ary.length; j++) {
                  if (ary[i] > ary[j]) {
                      int temp = ary[i];
                      ary[i] = ary[j];
                      ary[j] = temp;
                  }
              }
        }
        return ary;
    }
}