Scribd
Upload
45 views8 pages

Data Structure & Algorithms

The document discusses the Fibonacci search technique, which is a comparison-based algorithm that uses Fibonacci numbers to search for an element in a sorted array more efficiently than binary search. It works by recursively dividing the search space based on Fibonacci numbers and their properties. Specifically, Fibonacci numbers provide a model for designing recursive algorithms by defining each number as the sum of the previous two numbers in the series (0, 1, 1, 2, 3, 5, 8, etc.). This allows the search space to be narrowed on each iteration until the target element is found or determined not to exist.

Uploaded by

Sheikh Shaban
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
45 views8 pages

Data Structure & Algorithms

The document discusses the Fibonacci search technique, which is a comparison-based algorithm that uses Fibonacci numbers to search for an element in a sorted array more efficiently than binary search. It works by recursively dividing the search space based on Fibonacci numbers and their properties. Specifically, Fibonacci numbers provide a model for designing recursive algorithms by defining each number as the sum of the previous two numbers in the series (0, 1, 1, 2, 3, 5, 8, etc.). This allows the search space to be narrowed on each iteration until the target element is found or determined not to exist.

Uploaded by

Sheikh Shaban
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

DATA STRUCTURE &

ALGORITHMS
FIBONACCI SEARCHING TECHNIQUE
WHAT IS A
FIBONACCI SEARCH
TECHNIQUE?

• Fibonacci Search is a
comparison-based
technique that uses
Fibonacci numbers to
search an element in a
sorted array.
WHAT IS A
FIBONACCI
NUMBERS?

• Fibonacci numbers give a
model for designing recursive
programming algorithms

• It is a series of numbers in
which each number
( Fibonacci number ) is the sum
of the two preceding numbers.
The simplest is the series 0, 1,
1, 2, 3, 5, 8, etc.
WHAT IS A
RECURSIVE
PROGRAMMING
ALGORITHMS?

• Recursive algorithm is
a method of
simplification that divides
the problem into sub-
problems of the same
nature. The result of
one recursion is the input
for the next recursion
DEMONSTRATION
EXAMPLE OF FIBONACCI SEARCH
RELATIONSHIP BETWEEN BINARY SEARCH AND
FIBONACCI SEARCH
THANK YOU ʴ

You might also like