插入排序

import java.util.Arrays;

public class InsertionSort {
	private static int[] insertionSort(int[] array){
		if(array == null || array.length <= 1){
			return array;
		}else{
			for(int i=1; i<array.length; i++){
				for(int j=0; j<i; j++){
					if(array[j]<=array[i]){
						continue;
					}else{
						int temp = array[i];
						array[i] = array[j];
						array[j] = temp;
					}
				}
			}
		}
		
		return array;
	} 
	
	public static void main(String[] args) {
		int length = 10;
		int[] a = new int[length];
		for(int i=0; i<length; i++){
			a[i] = (int) (Math.random() * 100);
		}
		
		System.out.println("原始数组：" + Arrays.toString(a));
		
		System.out.println("排序后：" + Arrays.toString(insertionSort(a)));
	}

}

 

 

def insertion_sort(n):
	if len(n) == 1:
		return n
	b = insertion_sort(n[1:])
	m = len(b)
	for i in range(m):
		if n[0] <= b[i]:
			return b[:i]+[n[0]] + b[i:]
	return b + [n[0]]


print insertion_sort([1,4,10,6,2,9])

 

 

def insertion_sort(n):
	if len(n) == 1:
		return n
	for i in range(1, len(n)):
		for j in range(i):
			if n[j] <= n[i]:
				pass
			else:
				n[i],n[j] = n[j],n[i]
	return n



print insertion_sort([1,4,10,6,2,9,-1])