# MadeEasy Test Series: Algorithms - Time Complexity

160 views

Please show the ideal way to deal with such comparisons as I am getting g>=f

IN genral what logic shall be followed to analyse such complex comparions?

edited

## Related questions

1
243 views
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c, like cant we take both the recurrance call as combined as both have same parameter? and if not, then how to solve such?