0 votes 0 votes I need to find the tight bound of the Fibonacci sequence in dynamic programming (using theta). I only know the bound using big O is O(n). Any idea how to do it? Algorithms dynamic-programming time-complexity + – Mariela Prasetyo asked Oct 10, 2018 Mariela Prasetyo 321 views answer comment Share Follow See 1 comment See all 1 1 comment reply Raghav Khajuria commented Oct 10, 2018 reply Follow Share There are 2 ways of solving fibnocci series either by using recursion which will take O(2^n) times but if go by tabulation method using dynamic programming then max no of fn calls would be n so O(n) or theata (n) 1 votes 1 votes Please log in or register to add a comment.
