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