Explain Fibonacci Sequence ? 


==> Fibonacci Sequence---

        Fibonacci series 0,1,1,2,3,5,8,13,21,…..

  1. if n=0 or n=1, then Fn =n
  2. if n>1 then Fn=Fn-1+Fn-2

         fib(n)

        {

         if(n==0)

         return 0;

         if(n==1) return 1;

         else

         return( fib(n-1)+fib(n-2));

          } 



Share to whatsapp

More Questions from Data Structures and Algorithms Module 2

 Explain Applications of Stack ? 


View

Define Circular Queue. Describe implementation of Circular Queue ? 


View

Define stacks. Explain various operation of stacks ? 


View

Define Recursion. Explain types and requirement of recursion ?


View

Explain Dequeues- Double Ended Queues ? 


View

Define Tower of Hanoi . Explain algorithm for Tower of Hanoi ? 


View

Explain briefly Infix expression, Polish Notation and Reverse Polish Notation ?


View