📢 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 is NOT a divide-and-conquer

      algorithm?
      A MergeSort Correct Answer Incorrect Answer
      B QuickSort Correct Answer Incorrect Answer
      C Binary Search Correct Answer Incorrect Answer
      D HeapSort Correct Answer Incorrect Answer
      E Strassen’s Matrix Multiplication Correct Answer Incorrect Answer

      Solution

      HeapSort builds a heap and sorts iteratively, not using divide-and-conquer.

      Practice Next
      ask-question