very good design question ... pl give some simple examples for practice ! thankz
@pixxel6804
11 ай бұрын
given exercise questions were helpful when finished solving it
@shifanifrancis9962
11 ай бұрын
The brute force Fibonacci algorithm has an exponential time complexity of O(2^n) due to redundant calculations, making it highly inefficient for large values of n. This can be optimized using dynamic programming. The optimized dynamic programming (DP) algorithm has a linear time complexity of O(n) as it calculates each Fibonacci number once and stores them in an array, significantly improving efficiency for larger n.
@jayasankarnarayanan2153
11 ай бұрын
The brute force approach is recursion, which has a time complexity of O(2^n) The second approach is using dynamic programming to optimize the recursion, store values in an array, and compute from previous values in array instead of having a function call. This bottom up approach is called tabulation and has a time complexity of O(n)
@KOTAVENKATAMOHANSAI
11 ай бұрын
VAMSI KRISHNA (VTU22851) PRESENT MAM
@ShivaniGehlot-n1o
Жыл бұрын
sir, can we put our solutions here? should we code it as well?
Пікірлер: 8