java arraylis 删除_java arrayList的时间复杂度删除(元素)

我试图绘制ArrayList的remove(element)方法的Time Complexity.

我的理解是它应该是O(N),然而,它给我一个O(1).任何人都可以指出我在这里做错了什么？

先谢谢你.

public static void arrayListRemoveTiming(){

long startTime, midPointTime, stopTime;

// Spin the computer until one second has gone by, this allows this

// thread to stabilize;

startTime = System.nanoTime();

while (System.nanoTime() - startTime < 1000000000) {

}

long timesToLoop = 100000;

int N;

ArrayList list = new ArrayList();

// Fill up the array with 0 to 10000

for (N = 0; N < timesToLoop; N++)

list.add(N);

startTime = System.nanoTime();

for (int i = 0; i < list.size() ; i++) {

list.remove(i);

midPointTime = System.nanoTime();

// Run an Loop to capture other cost.

for (int j = 0; j < timesToLoop; j++) {

}

stopTime = System.nanoTime();

// Compute the time, subtract the cost of running the loop

// from the cost of running the loop.

double averageTime = ((midPointTime - startTime) - (stopTime - midPointTime))

/ timesToLoop;

System.out.println(averageTime);

}

}