![]() |
recursion complexity
i have a program that run merge on sorted arrays each array is in size n and i have k arrays by dividing to 2 until merge receive only 2 arrays merge them and then merge 2 bigger arrays i found that my complexity is: t(nk)=2(t(k/2)) + cnk what is the running time complexity?
|
| All times are GMT -4. The time now is 04:43 AM. |
Powered by vBulletin®
Copyright ©2000 - 2026, Jelsoft Enterprises Ltd.