插入排序

 1 package com.learning.algorithm;
 2 
 3 public class InsertSort {
 4     
 5     public int[] insertSort(int[] arrValue){
 6         
 7         for(int i=1;i<arrValue.length;i++){
 8             int min = arrValue[i];
 9             int index = i-1;
10             while(index>=0 && min<arrValue[index]){
11                 arrValue[index+1] = arrValue[index];
12                 index--;
13             }
14             arrValue[index+1] = min;
15         }
16         return arrValue;
17     }
18 
19     /**
20      * @param args
21      */
22     public static void main(String[] args) {
23         int[] arrValue = {89,39,56,93,2,58,43,51,33,67};
24         InsertSort is = new InsertSort();
25         int[] arrResult = is.insertSort(arrValue);
26         for(int value:arrResult){
27             System.out.print(value);
28             System.out.print(",");
29         }
30 
31     }
32 
33 }

 

转载于:https://www.cnblogs.com/ryanwangblog/p/3931527.html