Algorithm Analysis of Insertion Sort
-
05-11-2019 - |
Вопрос
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?
Нет правильного решения
Не связан с cs.stackexchange