recursion complexity - Domain Name Forum

09-06-2009, 09:51 PM

webdev

Senior Member

Join Date: Jun 2009

Posts: 7,868

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?

__________________
Website Development
Domain Name Forum

« Previous Thread | Next Thread »

Posting Rules
You may not post new threads You may not post replies You may not post attachments You may not edit your posts BB code is On Smilies are On [IMG] code is On HTML code is Off Forum Rules

Forum Jump

All times are GMT -4. The time now is 03:54 AM.

| Webmaster Forum | | Domain Name Forum |