1) Modify the mergesort as follows: instead of dividing the input list into two lists, the list is divided into three sublists of (roughly) the same size. (a) Write down the recursive algorithm; (b) Let t(n) be the running time of your algorithm, write a recurrence for t(n); (c) What is the running time and how does it compare tothe traditional mergesort? Note that you need to solve for t(n) first. Note: if you want to merge two lists L1and L2, you can just say in your algorithm “Merge L1 and L2.”
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
27 | 28 | 29 | 30 | 1 | 2 | 3 |
4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 13 | 14 | 15 | 16 | 17 |
18 | 19 | 20 | 21 | 22 | 23 | 24 |
25 | 26 | 27 | 28 | 29 | 30 | 31 |