← GATE CSE 1990

Q3-v

MCQMarks unknown

The complexity of comparison based sorting algorithms is:

(A)

$\Theta (n \log n)$

(B)

$\Theta (n)$

(C)

$\Theta \left(n^2\right)$

(D)

$\Theta (n\sqrt n)$

Sign in to save attempts.

Loading…