数据结构-冒泡排序

package com.datastack.search;

import java.util.Arrays;

//冒泡排序
public class BubSearch {
	public static void main(String[] args) {
		int[] arr = {6,1,8,23,3,5,6,9,12};
		int temp;
		for(int i=0; i<arr.length; i++){
			for(int j=0; j<arr.length-1-i; j++){
				if(arr[j]>arr[j+1]){
					temp = arr[j];
					arr[j] = arr[j+1];
					arr[j+1] = temp;
				}
			}
		}
		System.out.println(Arrays.toString(arr));
	}
}