插入排序。

package exercise01;

public class InsertionSort {
	
	

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] arrays = { 10, 52, 13, 54, 35, 67, 37, 88, 39, 180 };
		insertionSort(arrays);

		for (int array : arrays) {
			System.out.println(array);
		}
	}
	
	public static void insertionSort(int []arrays){
		for(int i=0;i= 0){
				//比插入的数大就往后移，直到前面的数比插入的数小为止
				if(temp