Question

Arrange the following time complexities in increasing order:
• [A.] Linear search worst case
• [B.] Quick sort expected running time
• [C.] Binary search best case
• [D.] Bubble sort worst case
Choose the correct answer from the options given below:

• A. A, C, B, D
• B. C, D, B, A
• C. C, A, B, D
• D. A, B, C, D

Hint:

Always remember growth order: \(1 < \log n < n < n\log n < n^2 < 2^n\).

Answer 1

The Correct Option is C