用java实现的迭代和递归插入排序

下面使用一个java实现的迭代版的递归版的插入排序。
package sort;
import java.util.Date;
import java.util.Random;
/*
* 插入排序
*/
public class InsertSort{
public static void main(String args[])
{
int len = 20;
Date date = new Date();
Random random = new Random(date.getSeconds());
int data[]=new int[len];
for(int i = 0; i < len; i++)
{
data[i]=(int)(random.nextFloat()*100+1);
}
show(data);
insertSort(data,data.length);
show(data);
System.out.println(binarySearch(data,1,data.length,55));
System.out.println(binarySearch2(data,55));
insertSortDesc(data);
show(data);
System.out.println(binarySearch(data,1,data.length,55));
System.out.println(binarySearch2(data,55));

}
/*
* 插入排序核心
*/
private static void insertSortDesc(int[] data)
{
int length = data.length;
for(int i = 1; i < length; i++)
{
int temp = data[i];
int j = i-1;
while(j >= 0 && data[j] < temp)
{
data[j+1] = data[j];
j--;
}
data[j+1] = temp;
}
}

private static void insertSortAsc(int[] data)
{
int length = data.length;
for(int i = 1; i < length; i++)
{
int temp = data[i];
int j = i-1;
while(j >= 0 && data[j] > temp)
{
data[j+1] = data[j];
j--;
}
data[j+1] = temp;
}
}
private static void show(int[] data)
{
System.out.println("========================");
for(int i = 0; i < data.length; i++)
{
System.out.print(data[i] + " ");
}
System.out.println();
System.out.println("========================");
}
/*
* 使用递归实现的插入排序算法
*/
private static void insertSort(int[] data,int n)
{
if(n>1)
{
insertSort(data,n-1);
merge(data,n-1,n);
}
}
private static void merge(int[] data,int end,int n)
{
int temp=data[n-1];
int i;
for( i=end-1; i>=0; i--)
{
if(data[i]>temp)
data[i