fibonacci_search.cpp File Reference

Fibonacci search algorithm More...

#include <iostream>
#include <vector>
#include <cassert>
#include <cstdlib>
#include <algorithm>

Include dependency graph for fibonacci_search.cpp:

Functions
int	fibonacci_search (const std::vector< int > &arr, int value)
	using fibonacci search algorithm finds an index of a given element in a sorted array More...
bool	no_occurence_tests ()
	random tests for checking performance when an array doesn't contain an element
bool	random_tests ()
	random tests which cover cases when we have one, multiple or zero occurences of the value we're looking for
int	main ()

Detailed Description

Fibonacci search algorithm

Author

sprintyaf

Function Documentation

fibonacci_search()

int fibonacci_search	(	const std::vector< int > &	arr,
		int	value
	)

using fibonacci search algorithm finds an index of a given element in a sorted array

Parameters

arr	sorted array
value	value that we're looking for

Returns

if the array contains the value, returns an index of the element. otherwise -1.

                                                          {
    // initialize last and current members of Fibonacci sequence 
    int last = 0, current = 1;
    int length = arr.size(); // array size
    // next member of Fibonacci sequence which is "last" + "current"
    int next = last + current; 
 
    // "next" will store the smallest Fibonacci number greater or equal to "length"
    while(next < length){
        last = current;
        current = next;
        next = last + current;
    }
 
    // "offset" is the end of eliminated range from front
    int offset = -1, index;
    // while loop until there are elements left to consider.
    // when "next" becomes 1, last is equal to 0, so search is done,
    // because arr[offset] will already be eliminated
    while(next > 1){
        // check if "last" is valid location
        index = std::min(offset + last, length-1);
        // if value is greater than the value at "index", eliminate the subarray from offset to index
        if(arr[index] < value){
            next = current;
            current = last;
            last = next - current;
            offset = index;
        // if value is less than the value at "index", eliminate the subarray after index+1
        } else if(arr[index] > value){
            next = last;
            current = current - last;
            last = next - current;
        // element is found
        } else {
            return index;
        }
    }
    // comparing the last element
    if(current && !arr.empty() && arr[offset+1] == value){
        return offset+1;
    }
    // value was not found, return -1
    return -1;
}

Here is the call graph for this function:

main()

int main

(

)

Main Function testing the algorithm

           {
    assert(no_occurence_tests());
    assert(random_tests());
    return 0;
}

Here is the call graph for this function: