Algorithm Analysis of Insertion Sort

cs.stackexchange https://cs.stackexchange.com/questions/112101

题

Why is the recurrence formula for insertion sort is T(n-1) + n?

I understand the T(n-1) part but the why does the cost for merging results is n or linear. Do we have to merge in insertion sort?

没有正确的解决方案

许可以下： CC-BY-SA 和 归因
不隶属于 cs.stackexchange
scroll top