Recurrence Relation for time complexity
A recurrence is an equation or inequality that describes a function in terms of its values on smaller inputs, or A recurrence is a recursive description of a function. To solve a Recurrence Relation means to obtain a function defined on the natural numbers that satisfy the recurrence.
Decreasing Recurrence Relation Functions
2. (T(n)= T(n-1) + n) = O(n^2)
3. (T(n)= T(n-1) + log n) = O(nlogn)
5. Masters Theorem Decreasing Function
Dividing Recurrence Relation Functions
3. T(n)= 2T(n/2) +n = O(nlogn)
4. Masters Theorem in Algorithms for Dividing Function
Comments
Post a Comment