【正文】
Introduction to Algorithms 計(jì)算機(jī)算法導(dǎo)論 2022~2022年第一學(xué)期 Quiz(10 minutes) Question 1. Suppose we are paring implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort runs in 64nlgn steps. For which values of n does insertion sort beat merge sort? (n44) 2. What is t