Q. Which of the following sorting algorithms does NOT have a worst-case running time of O(n2)?

  • (A) Insertion sort
  • (B) Merge sort
  • (C) Quicksort
  • (D) Bubble sort
💬 Discuss
✅ Correct Answer: (B) Merge sort

Published by Prabhas Kapoor ⭐ 1.64K Points at 10-Jul-2022 12:40 pm in C Programming

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️
185
Total Visits
📽️
4 y ago
Published
🎖️
Prabhas Kapoor
Publisher
📈
90%
Success Rate