[Solved] CH08-320201-Homework 2 Merge Sort and Recurrences
5.0
1 customer review
Digital download
Digital download
$25.00
- Availability
- In stock
- Checkout
- One item
Need a hand?
Message us on WhatsApp for payment or download support.
- Implement a variant of Merge Sort that does not divide the problem all the way down to subproblems of size 1. Instead, when reaching subsequences of length k it applies Insertion Sort on these n/k
- Apply it to the different sequences from Problem 2 (from last homework) for different numbers of k. Add the computation times to the plots you had generated in Problem 2.
- How do the different values of k change the best-, average-, and worst-case asymptotic time complexities for this variant? Explain/proove your answer.
- Based on the results from (b) and (c), how would you choose k in practice? Briefly explain.
- T(n) = 36T(n/6) + 2n.
- T(n) = 5T(n/3) + 17n1.2.
- T(n) = 12T(n/2) + n2 lgn.
- T(n) = 3T(n/5) + T(n/2) + 2n.
- T(n) = T(2n/5) + T(3n/5) + (n).