How to Find the n-th Fibonacci Number in Python Without Recursion

Discover a simple Python solution to find the `n-th` Fibonacci number without using recursion. Learn how to modify your code for optimal performance!
---

Visit these links for original content and any more details, such as alternate solutions, latest updates/developments on topic, comments, revision history etc. For example, the original title of the Question was: How can i get nth fibonacci number ? i want to find it without use recursion.I write code like that but i want my program shows only nth number

If anything seems off to you, please feel free to write me at vlogize [AT] gmail [DOT] com.
---
Finding the n-th Fibonacci Number Without Recursion

The Fibonacci sequence is a fascinating series of numbers where each number is the sum of the two preceding ones, usually starting with 0 and 1. Many might get tempted to use recursive functions to find the n-th Fibonacci number, but recursion can be less efficient due to repeated computations. Instead, let's explore how to calculate the n-th Fibonacci number using an iterative approach in Python.

The Problem: How to Get the n-th Fibonacci Number?

You might have tried to write code to calculate the n-th Fibonacci number. However, you may have noticed that your program prints all the Fibonacci numbers up to n rather than just the n-th number. Here's an excerpt from the code that you've shared:

[[See Video to Reveal this Text or Code Snippet]]

Your intention was clear, but the printing happens at each iteration of the loop, which leads to unnecessary output.

The Solution: Optimizing Your Code

To adjust your code so that it only displays the n-th Fibonacci number, you'll need to move the print statement outside of the loop. By doing this, the program will calculate all required Fibonacci numbers quietly without printing them until it reaches the final result. Here is the optimized version of your code:

[[See Video to Reveal this Text or Code Snippet]]

Key Changes Made

Initialization: We start by setting fib1 and fib2 to 1, as these are the first two Fibonacci numbers.

Loop Structure: We maintain the loop that iterates from 2 to n, computing each Fibonacci number sequentially.

Output Once: The final result, c, is printed just once after the loop is complete to show only the n-th Fibonacci number.

Example Usage

When you run the updated code and input 10 as the value for n, you'll receive the following output:

[[See Video to Reveal this Text or Code Snippet]]

Conclusion

Now you have an efficient way to find the n-th Fibonacci number without resorting to recursion. This method not only enhances performance but also simplifies your program by reducing unnecessary output. Try modifying the code further and experiment with different values of n to see how quickly you can find larger Fibonacci numbers! Happy coding!