Chapter 18, Problem 13PC

Program Plan Intro

Stack Based Fibonacci Function

Program Plan:

• Define the main function.
  • Include required header files.
  • Prompt user to enter a positive integer till which fibonacci series needs to be found.
  • Print the Fibonacci series.
  • Create a fibonacci function that computes the last term of the fibonacci sequence using stack operations.
  • Push the first two terms of the Fibonacci sequence into a stack using the push () operation.
  • Push the rest of the terms from 2 till last term into the stack.
  • Pop last two elements off the stack using the stack pop() operation.
  • The sum of element t1 and t2 is calculated and pushed onto the stack.
  • Return element present at top of the stack.