a) T(n) = 2T(n/2) + n
b) T(n) = 2T(n/2) + c
c) T(n) = T(n-1) + n
d) T(n) = T(n-1) + c
What will be the recurrence relation of the code of recursive insertion sort?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
What will be the recurrence relation of the code of recursive insertion sort?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!