0
对于以下问题,大O是什么?确定复杂性等级或大-o
public static void mystery(int[] list)
{
for (int i = 0; i < list.length/2; i++)
{
int j = list.length-1-i;
int temp = list[i];
list[i] = list[j];
list[j] = temp;
}
}
它是O(N)..... – sgarizvi 2013-02-11 07:52:31