优化的快速排序Java实现，有一块元素个数小于k后采用插入排序

import java.util.ArrayList;

public class Test_3 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		// int len = 20;

		// display(array);
		for (int len = 10; len <= 100; len = len + 10) {
			ArrayList<Integer> list = new ArrayList<Integer>();
			for (int i = 0; i < 10000000; i++) {
				list.add((int) (Math.random() * 10000000));
			}

			int[] array = new int[list.size()];
			for (int j = 0; j < list.size(); j++) {
				array[j] = list.get(j);
			}
			//display(array);
			
			System.out.println("数组长度为：" + array.length+"      k的值是:"+len);
			
			long startMili = System.currentTimeMillis();// 当前时间对应的毫秒数
			System.out.println("开始优化的快速排序时刻： " + startMili);
			// quciksort_optimizat