Find all the Fibonacci numbers for a given limit

Fibonacci numbers are a series of numbers in which each number is formed by adding previous two numbers in the series. For example, we start by 1 and 2, and then repetitively add the add the numbers to result in the next number.

For a given max limit 10, we would want to find the first 10 Fibonacci numbers.

Series: 1,2,3,5,8,13,21,34,55,89

        public static List<int> DoGetFibonacci(int n)
            int a = 1, b = 2, c = 0;
            List<int> series = new List<int>();


            while (series.Count < n)
                c = a + b;
                a = b;
                b = c;

            return series;

How it works:

The core of Fibonacci series is adding up previous two numbers a and b to form the next number c. Taking this as the base we build the logic and put it in a loop to iteratively generate the series.

Buy Me A Coffee

Found this article helpful? Please consider supporting!


I'm a full-stack developer and a software enthusiast who likes to play around with cloud and tech stack out of curiosity. You can connect with me on Medium, Twitter or LinkedIn.

Leave a Reply

Your email address will not be published. Required fields are marked *