πŸ“’ Too many exams? Don’t know which one suits you best? Book Your Free Expert πŸ‘‰ call Now!

  • google app store apple app store
  • βœ–

      Question

      Which of the following sorting algorithms has the best

      worst-case time complexity of O(n log n)?
      A Quick Sort Correct Answer Incorrect Answer
      B Bubble Sort Correct Answer Incorrect Answer
      C Insertion Sort Correct Answer Incorrect Answer
      D Heap Sort Correct Answer Incorrect Answer
      E Selection Sort Correct Answer Incorrect Answer

      Solution

      Answer: d) Heap Sort

      Practice Next
      ask-question