排序算法

1：冒泡

	public static long[] getSortData(long[] data) {
		long tem = 0;
		for (int i = 0; i < data.length - 1; i++) {
			for (int j = i + 1; j < data.length; j++) {
				if (data[i] > data[j]) {
					tem = data[i];
					data[i] = data[j];
					data[j] = tem;
				}
			}

		}

		return data;
	}

 第二种

   public static void mp(){
    	Integer[] a =new Integer []{1,3,4,6,2};
    	int tmp=0;
    	for(int i=0;i<a.length ;i++){
    		for(int j=1;j<a.length-i;j++){
                  if(a[j]>a[j-1]){
                	 tmp=a[j];
                	 a[j]=a[j-1];
                	 a[j-1]=tmp;
                  }    			
    		}
    	}
    	System.out.println(Arrays.toString(a));
    }