《计算模型与算法技术教学课件》本科算法练习题答案.pptxVIP

1.Draw the process of merge sort for the following data: (8%)12, 6, 2, 9, 20, 8, 13, 5Filling: the time complexity of merge sort is ?(__________). (2%)the time complexity of merge sort is ?(nlogn)2.Construct an AVL tree for the list 5, 8, 10, 3, 12, 4, 7. (10%)3. 1) For array A [30, 5, 20, 56, 8, 75, 31, 19], please use the Bottom-Up algorithm to construct a heap (max heap). (6%)2) The time-complexity of the worst-case heap construction is _______. (2%)3) Give an example of worst-case heap construction. (2%)1)30307552056755630582031582031568753119191975755630563119820311982030552) The time-com