Q. What is the worst case time complexity of a quick sort algorithm?

(A) o(n)
(B) o(n log n)
(C) o(n2)
(D) o(log n)

💬 Discuss

✅ Correct Answer: (C) o(n2)

Explanation: the worst case performance of a quick sort algorithm is mathematically found to be o(n2).

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

the worst case performance of a quick sort algorithm is mathematically found to be o(n2).

💬 Discussion

📊 Question Analytics

👁️

751

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

86%

Success Rate