2 2 votes Suppose we do merge sort with a three-way split: divide the array into 3 equal parts, sort each part and do a 3 way merge. What would the worst-case complexity of this version be? O($n^2$) O($n^2$ log3n) O(n log2n) O(n $(log2n)^2$) Algorithms nptel-quiz merge-sort time-complexity + – rsansiya111 1.4k views answer comment Share Follow Print See 1 comment 1 1 comment reply charan2628 commented Dec 8, 2021 reply Follow flag Hi, In the option C, is that log base 2? If it is then it should be the answer. 0 0 replyShare Please log in or register to add a comment.
Best answer 0 0 votes C. O(n log2n) ... # A variant of merge sort is called 3-way merge sort where instead of splitting the array into 2 parts we split it into 3 parts… ## Merge sort recursively breaks down the arrays to subarrays of size half... ### Similarly, 3-way Merge sort breaks down the arrays to subarrays of size one third... 1. https://en.wikipedia.org/wiki/Merge_sort 33 answered Mar 8, 2022 • selected Mar 9, 2022 by rsansiya111 33 comment Share Follow 0 reply Please log in or register to add a comment.
