Repository files navigation

1. Linear Search
2. Jump Search
3. Binary Search
4. Interpolation Search
5. Exponential 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.

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

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

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

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

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

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

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

Exponential search is a searching algorithm used to find the position of a target element in asorted 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.

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