Home » Algorithms

Check whether a number is Fibonacci or not

Here, we are going to learn how to search a Fibonacci number using searching algorithm using C++ program?
Submitted by Radib Kar, on November 10, 2018


We are often used to generate Fibonacci numbers. But in this article, we are going to learn about how to search Fibonacci numbers in an array?


Fibonacci numbers are often used in mathematics and computer science fields. Fibonacci numbers are often considered as an important part of number theory because of their some amazing properties and the connection with the golden ratio. We are all familiar with Fibonacci number generation using dynamic programming or simple Fibonacci property. But to check a number whether it's part of Fibonacci series or not is something really challenging.

Algorithms to search for Fibonacci numbers

The searching algorithm is linear search but what is challenging is to check for the number whether Fibonacci or not.

  1. Brute force
    The brute force approach is to generate the Fibonacci series and to store that in an array. We need to generate the Fibonacci series till we cover the maximum element of the search array. Then we need to check each element of the search array whether it's part of the new array consisting generated Fibonacci series. Needless to say, the brute force approach is not going to work for larger values since the complexity is much higher and the complexity also includes Fibonacci series generation which is an additional task here.
  2. Using Mathematical formula
    Fibonacci numbers have an amazing property and one of the property is that for every Fibonacci number n, 5n2+4 or 5n2-4 is a perfect square.
    Such property has made the checking possible in only O(1) time complexity and we don't need any additional storage.

C++ implementation for searching Fibonacci numbers

#include <bits/stdc++.h>
using namespace std;

int isSquare(int k){
	// if k isn't perfect square then the square root 
	//will be a float value but we are rounding it off to integer
	int s=sqrt(k);
	// only in case of perfect square there 
	//will not be any rounding off error
		return 1;
		return 0;

int checkFibo(int k){
	//checking whether (5n^2+4) or (5n^2-4) is perfect square 
		return 1;
		return 0;

void findFibos(int* a, int n){
	int count=0;
	for(int i=0;i<n;i++){
			cout<<a[i]<<" ";
		cout<<"\nabove "<<count<<" fibonacci numbers are present in the array\n";
		cout<<"\nno fibonacci number is present in the array";

int main(){
	int n;
	// enter array length
	cout<<"enter no of elements\n"; 
	int* a=(int*)(malloc(sizeof(int)*n));
	//fill the array
	cout<<"enter elements................\n";  
	for(int i=0;i<n;i++)
	return 0;

Output (first run)

enter no of elements 
enter elements................ 
2 3 13 21
above 4 fibonacci numbers are present in the array

Output (second run)

enter no of elements 
enter elements................ 

no fibonacci number is present in the array 

Comments and Discussions

Languages: » C » C++ » C++ STL » Java » Data Structure » C#.Net » Android » Kotlin » SQL
Web Technologies: » PHP » Python » JavaScript » CSS » Ajax » Node.js » Web programming/HTML
Solved programs: » C » C++ » DS » Java » C#
Aptitude que. & ans.: » C » C++ » Java » DBMS
Interview que. & ans.: » C » Embedded C » Java » SEO » HR
CS Subjects: » CS Basics » O.S. » Networks » DBMS » Embedded Systems » Cloud Computing
» Machine learning » CS Organizations » Linux » DOS
More: » Articles » Puzzles » News/Updates

© https://www.includehelp.com some rights reserved.