0 votes 0 votes The running time of using two-way merge-sort technique to sort a file of $n>1$ record is $2T (n/2) + \theta (n)$ $\text{lg}(n) + \theta(n)$ $\theta (n)$ $O(n)$ Others kpgcet-cse-2019 + – gatecse asked Aug 4, 2019 • recategorized Aug 6, 2019 by go_editor gatecse 193 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Ans: A In case of 2-way Merge sort we get the equation: T(n) = 2T(n/2) + θ(n) Similarly, in case of 3-way Merge sort we get the equation: T(n) = 3T(n/3) + θ(n) nocturnal123 answered Aug 21, 2020 nocturnal123 comment Share Follow See all 0 reply Please log in or register to add a comment.