This is a simple App about Complexity Theory in computer science by enlightening of Nayuki.
By solving a recurrence relation , it seems we can analyze the asymptotic run time of a recursive algorithm in the study of complexity theory in computer science Master Theorem (a.k.a. Master method).
This JavaScript app, automatically solves your given recurrence relation by applying the versatile. But it only supports polynomial or polylogarithmic functions