📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

  • google app store apple app store

    • Question

      For a comparison-based sorting algorithm, which lower

      bound applies to the worst-case number of comparisons?
      A Ω(n) Correct Answer Incorrect Answer
      B Ω(n log n) Correct Answer Incorrect Answer
      C Ω(log n) Correct Answer Incorrect Answer
      D Ω(n²) Correct Answer Incorrect Answer
      E Ω(n!) Correct Answer Incorrect Answer

      Solution

      Comparison sort lower bound is Ω(n log n) comparisons in the worst case by decision tree argument.

      Practice Next
      ask-question