java - 确定复杂度等级或大o

Question

以下问题的大 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;
    }
} 

Answer 1

It's O(n), since it loops the array only once.