英语翻译consider a recursive mergesort implementation that calls
英语翻译
consider a recursive mergesort implementation that calls insertion sort on sublists smaller than some threshold.if there are n calls to mergesort,how many calls will there be to insertion sort?why?就前面那一句,这是数据结构的一道题