0% found this document useful (0 votes)
2 views

SEARCHING ALGORITHM

The document outlines various searching algorithms including Linear Search, Binary Search, Interpolation Search, Jump Search, Exponential Search, and Fibonacci Search. Each algorithm is described with its method of operation, focusing on how they search through sorted or unsorted data. The document provides a concise overview of the steps involved in each algorithm.

Uploaded by

24-04886
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views

SEARCHING ALGORITHM

The document outlines various searching algorithms including Linear Search, Binary Search, Interpolation Search, Jump Search, Exponential Search, and Fibonacci Search. Each algorithm is described with its method of operation, focusing on how they search through sorted or unsorted data. The document provides a concise overview of the steps involved in each algorithm.

Uploaded by

24-04886
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 24

Searching

Algorithms
Linear Search
Algorithm
Linear Search
Algorithm
A linear search algorithm is a
simple searching method where
you check each element in a list
or array one by one until you find
the target value or reach the end
of the list.
• Start from the first element.
• Compare each element with
the target value.
• If a match is found, return the
index of the element.
• If no match is found after
checking all elements, return -
1 (or indicate that the value is
not present)
binary Search
Algorithm
binary search
algorithm
A binary search algorithm is a
fast search method used on a
sorted list. It works by repeatedly
dividing the list in half and
narrowing down the search range
based on whether the target
value is larger or smaller than the
Interpolation Search
Algorithm
Interpolation Search
Algorithm
Interpolation search is an
improved version of binary search
that works on sorted and
uniformly distributed data.
Instead of checking the middle
element, it estimates the likely
position of the target value based
ARRAY
=[ 1,3,5,7,9]
Jump Search
Algorithm
jump search algorithm
Jump search is a searching
algorithm used on sorted arrays.
It works by jumping ahead by a
fixed number of steps and then
doing a linear search within the
block where the target value
might be.
• Start at the beginning of the
list.
• Jump ahead by a fixed number
of steps (usually √n).
• If the value at that spot is
greater than or equal to the
target, stop and search
backward step-by-step.
• If the value is smaller, keep
Exponential Search
Algorithm
Exponential Search
Algorithm
Exponential search is a
searching method used on sorted
arrays. It works by doubling the
search range (exponentially) until
the target value is within the
range, and then performing a
binary search on that range.
Fibonacci Search
Algorithm
Fibonacci Search
Algorithm
Fibonacci search is a searching
algorithm used on sorted arrays.
It works by dividing the array
using Fibonacci numbers to
narrow down the search range.
THANK YOU

You might also like