Question

Which of the following algorithms have time order of complexity?
• [A.] Insertion sort
• [B.] Worst case Search in Binary Search tree
• [C.] Insertion in Stack
• [D.] Quick sort worst case
Choose the correct answer from the options given below:

• A. C and D only
• B. A and B only
• C. A and C only
• D. A and D only

Hint:

Constant time \(O(1)\) operations are always fastest; avoid confusing them with \(O(n)\) or \(O(n^2)\).

Answer 1

The Correct Option is D