用JAVA實現的插入排序

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();
}
}

aaron@aaron-ubuntu:~/study$ javac InsertSort.java   -Xlint:unchecked
aaron@aaron-ubuntu:~/study$ java InsertSort
The ArrayList Sort Before:
al[0]=45
al[1]=20
al[2]=79
al[3]=53
al[4]=15
al[5]=41
al[6]=2
al[7]=59
al[8]=98
al[9]=60
[20, 45, 79, 53, 15, 41, 2, 59, 98, 60]
[20, 45, 79, 53, 15, 41, 2, 59, 98, 60]
[20, 45, 53, 79, 15, 41, 2, 59, 98, 60]
[15, 20, 45, 53, 79, 41, 2, 59, 98, 60]
[15, 20, 41, 45, 53, 79, 2, 59, 98, 60]
[2, 15, 20, 41, 45, 53, 79, 59, 98, 60]
[2, 15, 20, 41, 45, 53, 59, 79, 98, 60]
[2, 15, 20, 41, 45, 53, 59, 79, 98, 60]
[2, 15, 20, 41, 45, 53, 59, 60, 79, 98]
The ArrayList Sort After:
al[0]=2
al[1]=15
al[2]=20
al[3]=41
al[4]=45
al[5]=53
al[6]=59
al[7]=60
al[8]=79
al[9]=98