Java常用算法之冒泡排序法示例

package com.jiuqil.dna;

public class BubbleSort {
	
	public static void main(String[] args) {
		
		int[] arr = {5, 4, 8, 9, 7, 6, 0, 3, 2, 1};
		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]){
					int temp;
					temp = arr[j];
					arr[j] = arr[j + 1];
					arr[j + 1] = temp;
				}
			}
		}
		for(int i = 0; i < arr.length; i++){
			System.out.print(arr[i] + " ");
		}
		
	}

}