algorithm - Insertion sort expenditure -
I have tried to prove that an integration with binary search needs to be sorted. Tried to use but i hung up
t_w (1) = 0
t_w (n) & lt; = Log_2 (n-1) + 2 + t_w (n -1)
and
t_w (n) & lt; = N log n
with n = 2 ^ k; Epiclon N
I do not know how to solve it: t_2 (2 ^ k + 1) & lt; = Log_2 (2 ^ k) + 2 ^ k * log_2 (2 ^ k) how to go? Where's my fault
Thank you for your help
Comments
Post a Comment