public class InsertionSort{ /**插入排序算法*/ public static int[] insertionSort(int[] arr){ if(arr==null || arr.length<=1){ return arr; } int key; int i; for(int j=1;j<arr.length;j++){ key=arr[j]; i=j-1; while(i>=0&&arr[i]>key){ arr[i+1]=arr[i]; i=i-1; } arr[i+1]=key; } return arr; } /**测试实例*/ public static void main(String[] args){ int[] arr={5,2,4,6,1,3}; insertionSort(arr); for(int i:arr){ System.out.print(i+" "); } } }