Given a sorted array arr[] of size n and an integer x. Your task is to check if the integer x is present in the array arr[] or not. Return index of x if it is present in array else return -1.
Examples:
Input: arr[] = [2, 3, 4, 10, 40], x = 10
Output: 3
Explanation: 10 is present at index 3.
Input: arr[] = [2, 3, 4, 10, 40], x = 11
Output: -1
Explanation: 11 is not present in the given array.
What is Fibonacci Search?
Fibonacci Search is a comparison-based technique that uses Fibonacci numbers to search an element in a sorted array.
Similarities of Fibonacci Search with Binary Search
- Works for sorted arrays
- A Divide and Conquer Algorithm.
- Has Log n time complexity.
Differences of Fibonacci Search with Binary Search
- Fibonacci Search divides given array into unequal parts
- Binary Search uses a division operator to divide range. Fibonacci Search doesn't use /, but uses + and -. The division operator may be costly on some CPUs.
- Fibonacci Search examines relatively closer elements in subsequent steps. So when the input array is big that cannot fit in CPU cache or even in RAM, Fibonacci Search can be useful.
Background
Fibonacci Numbers are recursively defined as F(n) = F(n-1) + F(n-2), F(0) = 0, F(1) = 1. First few Fibonacci Numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...
Below observation is used for range elimination, and hence for the O(log(n)) complexity.
F(n - 2) ≈ (1/3)*F(n) and (Note : This is an approximation, not equal)
F(n - 1) ≈ (2/3)*F(n).
Fibonacci Search Algorithm - O(log n) Time and O(1) Space
The idea is to first find the smallest Fibonacci number that is greater than or equal to the length of the given array. Let the found Fibonacci number be fib (m’th Fibonacci number). We use (m-2)’th Fibonacci number as the index. Let (m-2)’th Fibonacci Number be i, we compare arr[i] with x, if x is same, we return i. Else if x is greater, we recur for subarray after i, else we recur for subarray before i.
Let arr[0..n-1] be the input array and the element to be searched be x.
- Find the smallest Fibonacci Number greater than or equal to n. Let this number be fibM [m’th Fibonacci Number]. Let the two Fibonacci numbers preceding it be fibMm1 [(m-1)’th Fibonacci Number] and fibMm2 [(m-2)’th Fibonacci Number].
- While the array has elements to be inspected:
- Compare x with the last element of the range covered by fibMm2 (variable a in the below code).
- If x matches, return index
- Else If x is less than the element, move the three Fibonacci variables two Fibonacci down, indicating elimination of approximately rear two-third of the remaining array.
- Else x is greater than the element, move the three Fibonacci variables one Fibonacci down. Reset offset to index. Together these indicate the elimination of approximately front one-third of the remaining array.
- Since there might be a single element remaining for comparison, check if fibMm1 is 1. If Yes, compare x with that remaining element. If match, return index
C++
#include <bits/stdc++.h>
using namespace std;
// Returns index of x if present, else returns -1
int search(vector<int> &arr, int x) {
int n = arr.size();
// initialize first three fibonacci numbers
int a = 0, b = 1, c = 1;
// iterate while c is smaller than n
// c stores the smallest Fibonacci
// number greater than or equal to n
while (c < n) {
a = b;
b = c;
c = a + b;
}
// marks the eliminated range from front
int offset = -1;
// while there are elements to be inspected
// Note that we compare arr[a] with x.
// When c becomes 1, a becomes 08
while (c > 1) {
// check if a is a valid location
int i = min(offset + a, n - 1);
// if x is greater than the value at index a,
// cut the subarray array from offset to i
if (arr[i] < x) {
c = b;
b = a;
a = c - b;
offset = i;
}
// else if x is greater than the value at
// index a,cut the subarray after i+1
else if (arr[i] > x) {
c = a;
b = b - a;
a = c - b;
}
// else if element found, return index
else
return i;
}
// comparing the last element with x
if (b && arr[offset + 1] == x)
return offset + 1;
// element not found, return -1
return -1;
}
int main() {
vector<int> arr = {2, 3, 4, 10, 40};
int x = 10;
cout << search(arr, x);
return 0;
}
import java.io.*;
class GfG {
// Returns index of x if present, else returns -1
public static int search(int[] arr, int x) {
int n = arr.length;
// initialize first three fibonacci numbers
int a = 0, b = 1, c = 1;
// iterate while c is smaller than n
// c stores the smallest Fibonacci
// number greater than or equal to n
while (c < n) {
a = b;
b = c;
c = a + b;
}
// marks the eliminated range from front
int offset = -1;
// while there are elements to be inspected
// Note that we compare arr[a] with x.
// When c becomes 1, a becomes 08
while (c > 1) {
// check if a is a valid location
int i = Math.min(offset + a, n - 1);
// if x is greater than the value at index a,
// cut the subarray array from offset to i
if (arr[i] < x) {
c = b;
b = a;
a = c - b;
offset = i;
}
// else if x is greater than the value at
// index a,cut the subarray after i+1
else if (arr[i] > x) {
c = a;
b = b - a;
a = c - b;
}
// else if element found, return index
else
return i;
}
// comparing the last element with x
if (b != 0 && arr[offset + 1] == x)
return offset + 1;
// element not found, return -1
return -1;
}
public static void main(String[] args) {
int[] arr = {2, 3, 4, 10, 40};
int x = 10;
System.out.println(search(arr, x));
}
}
#!/usr/bin/env python3
# Returns index of x if present, else returns -1
def search(arr, x):
n = len(arr)
# initialize first three fibonacci numbers
a = 0
b = 1
c = 1
# iterate while c is smaller than n
# c stores the smallest Fibonacci
# number greater than or equal to n
while c < n:
a = b
b = c
c = a + b
# marks the eliminated range from front
offset = -1
# while there are elements to be inspected
# Note that we compare arr[a] with x.
# When c becomes 1, a becomes 08
while c > 1:
# check if a is a valid location
i = min(offset + a, n - 1)
# if x is greater than the value at index a,
# cut the subarray array from offset to i
if arr[i] < x:
c = b
b = a
a = c - b
offset = i
# else if x is greater than the value at
# index a,cut the subarray after i+1
elif arr[i] > x:
c = a
b = b - a
a = c - b
# else if element found, return index
else:
return i
# comparing the last element with x
if b and arr[offset + 1] == x:
return offset + 1
# element not found, return -1
return -1
if __name__ == "__main__":
arr = [2, 3, 4, 10, 40]
x = 10
print(search(arr, x))
using System;
class GfG {
// Returns index of x if present, else returns -1
public static int search(int[] arr, int x) {
int n = arr.Length;
// initialize first three fibonacci numbers
int a = 0, b = 1, c = 1;
// iterate while c is smaller than n
// c stores the smallest Fibonacci
// number greater than or equal to n
while (c < n) {
a = b;
b = c;
c = a + b;
}
// marks the eliminated range from front
int offset = -1;
// while there are elements to be inspected
// Note that we compare arr[a] with x.
// When c becomes 1, a becomes 08
while (c > 1) {
// check if a is a valid location
int i = Math.Min(offset + a, n - 1);
// if x is greater than the value at index a,
// cut the subarray array from offset to i
if (arr[i] < x) {
c = b;
b = a;
a = c - b;
offset = i;
}
// else if x is greater than the value at
// index a,cut the subarray after i+1
else if (arr[i] > x) {
c = a;
b = b - a;
a = c - b;
}
// else if element found, return index
else
return i;
}
// comparing the last element with x
if (b != 0 && arr[offset + 1] == x)
return offset + 1;
// element not found, return -1
return -1;
}
public static void Main() {
int[] arr = {2, 3, 4, 10, 40};
int x = 10;
Console.WriteLine(search(arr, x));
}
}
// Returns index of x if present, else returns -1
function search(arr, x) {
let n = arr.length;
// initialize first three fibonacci numbers
let a = 0, b = 1, c = 1;
// iterate while c is smaller than n
// c stores the smallest Fibonacci
// number greater than or equal to n
while (c < n) {
a = b;
b = c;
c = a + b;
}
// marks the eliminated range from front
let offset = -1;
// while there are elements to be inspected
// Note that we compare arr[a] with x.
// When c becomes 1, a becomes 08
while (c > 1) {
// check if a is a valid location
let i = Math.min(offset + a, n - 1);
// if x is greater than the value at index a,
// cut the subarray array from offset to i
if (arr[i] < x) {
c = b;
b = a;
a = c - b;
offset = i;
}
// else if x is greater than the value at
// index a,cut the subarray after i+1
else if (arr[i] > x) {
c = a;
b = b - a;
a = c - b;
}
// else if element found, return index
else
return i;
}
// comparing the last element with x
if (b && arr[offset + 1] === x)
return offset + 1;
// element not found, return -1
return -1;
}
let arr = [2, 3, 4, 10, 40];
let x = 10;
console.log(search(arr, x));
Illustration:
Let us understand the algorithm with the below example:
Illustration assumption: 1-based indexing. Target element x is 85. Length of array n = 11.
Smallest Fibonacci number greater than or equal to 11 is 13. As per our illustration, fibMm2 = 5, fibMm1 = 8, and fibM = 13.
Another implementation detail is the offset variable (zero-initialized). It marks the range that has been eliminated, starting from the front. We will update it from time to time.
Now since the offset value is an index and all indices including it and below it have been eliminated, it only makes sense to add something to it. Since fibMm2 marks approximately one-third of our array, as well as the indices it marks, are sure to be valid ones, we can add fibMm2 to offset and check the element at index i = min(offset + fibMm2, n).
Visualization:
Time Complexity analysis:
The worst-case will occur when we have our target in the larger (2/3) fraction of the array, as we proceed to find it. In other words, we are eliminating the smaller (1/3) fraction of the array every time. We call once for n, then for(2/3) n, then for (4/9) n, and henceforth.
Consider that:
Auxiliary Space: O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem