In the study of complexity theory in computer science, analyzing the asymptotic run time of a recursive algorithm typically requires you to solve a recurrence relation. This program automatically solves your given recurrence relation by applying the versatile master theorem (a.k.a. master method). However, it only supports functions that are polynomial or polylogarithmic.
Examples:Click on an example to run the numbers in the calculator below:
| « Back | Home | Login |
| Register | Guestbook | Forum |
| Chatroom | Upload Your Files | User Uploads |
| Online Services | Search Files | Wapmaster |
| Our Other Sites | Our Official Apps | Our Android Apps |