Q. Which of the following sorting algorithm has best case time complexity of O(n2)?

(A) bubble sort
(B) selection sort
(C) insertion sort
(D) stupid sort

💬 Discuss

✅ Correct Answer: (B) selection sort

Explanation: selection sort is not an adaptive sorting algorithm. it finds the index of minimum element in each iteration even if the

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

Explanation by: Mr. Dubey

selection sort is not an adaptive sorting algorithm. it finds the index of minimum element in each iteration even if the

💬 Discussion

📊 Question Analytics

👁️

270

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

83%

Success Rate