排序算法

选择排序

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

冒泡排序

    

/**
	 * 冒泡排序
	 * @param arr
	 */
	public static void bubbleSort (int[] arr) {
		for (int i = 0; i < arr.length-1; i++) {
			for (int j = 0; j < arr.length-i-1; j++) {
				if(arr[j]<arr[j+1]){
					int temp=arr[j];
					arr[j]=arr[j+1];
					arr[j+1]=temp;
				} 
			}
		}
	}

测试代码

public static void main(String[] args) {
		int[]arr={1,2,3,10,5,8};
		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i]+",");
		}
		bubbleSort(arr);
		System.out.println();
		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i]+",");
		}
	}