Ask Question
17 August, 08:33

3-way-Merge Sort : Suppose that instead of dividing in half at each step of Merge Sort, you divide into thirds, sort each third, and finally combine all of them using a three-way merge subroutine. What is the overall asymptotic running time of this algorithm?

+1
Answers (1)
  1. 17 August, 10:39
    0
    O (N log_3 N), as opposed to O (N log_2 N). Fewer recursive calls (smaller tree depth), but the trade-off is added complexity, especially in the merging routine (big O notation is hiding larger coefficients).
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “3-way-Merge Sort : Suppose that instead of dividing in half at each step of Merge Sort, you divide into thirds, sort each third, and ...” in 📘 Computers and Technology if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers