java排序

三种排序：插入排序，选择排序，冒泡排序。

package com.djy.algorithms;

public class Sorting {

	public static void main(String args[]) {
		Sorting obj = new Sorting();
		int[] array = { 7, 2, 5, 6, 4, 8, 1, 9, 3 };
		obj.bubbleSoring(array);
		for(int i : array){
			System.out.println(i);
		}
	}

	public void insertionSorting(int[] array) {
		for (int i = 1; i < array.length; i++) {
			for (int j = i - 1; j >= 0; j--) {
				if (array[j + 1] < array[j]) {
					int key = array[j + 1];
					array[j + 1] = array[j];
					array[j] = key;
				} else {
					break;
				}
			}
		}
	}

	public void selectionSorting(int[] array){
		for(int i=0;i<array.length;i++){
			for(int j=i+1;j<array.length;j++){
				if(array[j]<array[i]){
					int key = array[j];
					array[j] = array[i];
					array[i] = key;
				}
			}
		}
	}

	public void bubbleSoring(int[] array){
		for(int i=array.length-1;i>0;i--){
			for(int j=0;j<i;j++){
				if(array[j]>array[j+1]){
					int key = array[j+1];
					array[j+1] = array[j];
					array[j] = key;
				}
			}
		}
	}


}