Timeline for How do I find running time for the following divide and conquer problem?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 10, 2016 at 20:22 | comment | added | gnasher729 | Even for n = 4, n! is substantially larger than 16 ((n/4)!). For n = 12, n! is almost 5 million times larger than 16 ((n/4)!). | |
| Jul 10, 2016 at 11:42 | comment | added | Aditya pratap singh | I got what you told and fully satisfied by your answer.....but the book mentioned "using master theorem" in the solution that's why I wondered... book's solution might be wrong...hope so.. | |
| Jul 10, 2016 at 11:22 | vote | accept | Aditya pratap singh | ||
| Jul 10, 2016 at 10:44 | history | answered | Yuval Filmus | CC BY-SA 3.0 |