gadget can be used as many times as you like. You're also given an input of n numbers that you must sort. (a) Someone pr
Posted: Thu Jul 14, 2022 2:28 pm
gadget can be used as many times as you like. You're also given an input of n numbers that you must sort. (a) Someone proposes using this gadget to deal with large base cases in regular Merge-sort. Would that improve the time complexity by more than a constant multiplicative factor? (Explain) Enter your answer here (b) Do you have other ideas for using the gadget to beat Θ(nlogn) time? Enter your answer here