Teya Salat


seconds + f p _ x
(More)

Note:

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:

Input

Format: \(T(n) \: = \: a \: T(n \, / \, b) \, + \, Θ(n^k \, (\log n)^i)\).

(usually 0)
Output

Recurrence:
Solution:


Translate
Copyright © Arslan100 2020 - 2024

Home | About Us | Frequently Asked Question | Contact Us | Disclaimer | Terms of Services | Request Your File/Code









Online: 1 , Today: 1, Total: 148
Last modified: 01-05-2021