Q7

MCQ1 mark, −0.33

Given an integer array of size $N$ , we want to check if the array is sorted (in either ascending or descending order). An algorithm solves this problem by making a single pass through the array and comparing each element of the array only with its adjacent elements. The worst-case time complexity of this algorithm is

(A)

both $\mathrm{O}(N)$ and $\Omega(N)$

(B)

$\mathrm{O}(N)$ but $\operatorname{not} \Omega(N)$

(C)

$\Omega(N)$ but not $\mathrm{O}(N)$

(D)

neither $\mathrm{O}(N)$ nor $\Omega(N)$

Loading…