Ask Question
23 May, 14:27

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. 23 May, 17:34
    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?
Get 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 & Technology if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers