NOT O(N) OR O(2N)

Here again is the function from the previous question. Using big-oh notation, what is the best-case runtime for this function? int is_sorted( int *array, int n) { int i; for (i = 0; i < n - 1; i++) if (array [i] > array [i + 1]) return 0; return 1; }

O(log n)

O(2n)

O(n^2)

O(n)

O(1)

O(n log n)