Table of Contents

Linear Search
Jump Search
Binary Search
Interpolation Search
Exponential Search

Searching Slgorithms

Linear Search

Linear search is a searching algorithm that sequentially checks each element in a list until the desired element is found or the sequence ends.

Time Complexity

Best Case: O(1) (Element found at the beginning)
Worst Case: O(n) (Element at the end or not present)

Jump Search

Jump Search is a searching searching algorithm that works on sorted arrays. It reduces the number of comparisons by jumping ahead in fixed steps instead of checking elements one by one.

Time Complexity

Best Case: O(1) (First element is the target)
Worst Case: O(sqrt{n})

Binary Search

Binary search is a searching algorithm that find the desiired element in a sorted sequence by repeatedly dividing the search interval in half until the target is found or the interval is empty.

Time Complexity

Best Case: O(1) (Element is in the middle)
Worst Case: O(log n) (Element at the end or not present)

Interpolation Search

Interpolation search is a searching algorithm that is used to search for a target value in a uniformly distributed sorted array by estimating the position of the target based on its value.

Time Complexity

Best Case: O(1) (Target found on first guess)
Worst Case: O(log log n) (Assuming uniform distribution)

Exponential Search

Exponential search is a searching algorithm used to find the position of a target element in a sorted array by progressively doubling the size of the search range until the target is within that range. Once the range is found, Binary Search is applied to find the exact index of the target.

Time Complexity

Best Case: O(log n)
Worst Case: O(log n)