用插入法进行排序

最新推荐文章于 2021-11-11 16:48:25 发布

iteye_6918

最新推荐文章于 2021-11-11 16:48:25 发布

阅读量130

点赞数

分类专栏：面试文章标签： J#

面试专栏收录该内容

12 篇文章 0 订阅

订阅专栏

package test;
import java.util.*;
class InsertSort {
ArrayList al; public InsertSort(int num,int mod) {
al = new ArrayList(num);
Random rand = new Random();
System.out.println("The ArrayList Sort Before:");
for (int i=0;i<num ;i++) {
   al.add(new Integer(Math.abs(rand.nextInt()) % mod + 1));
   System.out.println("al["+i+"]="+al.get(i));
}
} public void SortIt() {
Integer tempInt;
int MaxSize=1;
for(int i=1;i<al.size();i++) {
   tempInt = (Integer)al.remove(i);
   if(tempInt.intValue()>=((Integer)al.get(MaxSize-1)).intValue()) {
    al.add(MaxSize,tempInt);
    MaxSize++;
    System.out.println(al.toString());
   } else {
    for (int j=0;j<MaxSize ;j++ ) {
     if (((Integer)al.get(j)).intValue()>=tempInt.intValue()) {
      al.add(j,tempInt);
      MaxSize++;
      System.out.println(al.toString());
      break;
     }
    }
   }
} System.out.println("The ArrayList Sort After:");
for(int i=0;i<al.size();i++) {
   System.out.println("al["+i+"]="+al.get(i));
}
} public static void main(String[] args) {
InsertSort is = new InsertSort(10,100);
is.SortIt();
}
}