【java】数组、arraylist、linkedlist随机访问和遍历性能比较

取的MAX=10,100,1000,10000,100000，发现容量越大，数组的性能优势越加明显，linkedlist直接跑不动了。。

package CompareArray;

import java.util.ArrayList;
import java.util.LinkedList;

public class ArrayCmp {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		long start,end;
		final int MAX = 100000;
		int arr[]=new int[MAX];
		ArrayList<Integer> arraylist = new ArrayList<>();
		LinkedList<Integer> linklist = new LinkedList<>();
		/*初始化各个数组链表*/
		for (int i=0;i<MAX;i++)
		{
			arr[i]=i;
			arraylist.add(i);
			linklist.add(i);
		}
		/*随机访问测试*/
		System.out.println("随机访问测试("+MAX+"):");
		start = System.nanoTime();
		int tmp;
		for (int i=0;i<MAX;i++)
			tmp = arr[i];
		end = System.nanoTime();
		System.out.println("数组:    		"+(end-start));
		start = System.nanoTim