插入排序

 `/**
 * 插入排序
 * 
 * @author Poarry
 * 
 */
public class InsertSort {
  public int[] InsertSort(int[] arrays) {
	if(arrays==null||arrays.length<2){
		return arrays;
	}
	int arrayLength = arrays.length;
	
	for (int i = 1; i < arrayLength; i++) {
		for (int j = i; j>0&&j < arrayLength; j--) {
			if(arrays[j-1]>arrays[j]){
				int temp = arrays[j-1];
				 arrays[j-1] = arrays[j];
				 arrays[j]=temp;
			}
			
		}
	}
	return arrays;
  }

}`