aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Data Structures (NCO)
  • Which of the following sorting algorithms has average-cas...
Multiple choice

Which of the following sorting algorithms has average-case and worst-case running time of O?

  1. Bubble sort

  2. Insertion sort

  3. Merge sort

  4. Quick sort

  5. _

Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Merge sort recursively sorts each group and merges them into a final, sorted sequence.

Keep practicing — related questions

  • Which of the following algorithms does not have the same complexity for the worst case and the average case?
  • Which of the following sorting algorithms has the lowest worst-case complexity?
  • Which of the following sorting algorithms has the lowest worst-case complexity?
  • Which of the following statements is/are true? 1. Quick sort algorithm and bubble sort algorithm takes O(n2...
  • Which of the following has average case complexity O(n ln(n))
  • Consider the following statements: 1. One of the drawbacks of presentations is that they fail to provide a ...
  • In the recent times a European country that has been worst affected by social differences is
  • Which of the following statements is true according to the text? Read the text and answer the multiple-choi...
Play the full quiz 🎤 Practise this topic out loud

Practice this topic

  • Data Structures and Algorithms (1518 questions)
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy