5 views

The running time of using two-way merge-sort technique to sort a file of $n>1$ record is

1. $2T (n/2) + \theta (n)$
2. $\text{lg}(n) + \theta(n)$
3. $\theta (n)$
4. $O(n)$
in Others
recategorized | 5 views