📄️ Linear Search
Sequentially checks each element in the array until the target is found or the array ends.
📄️ Binary Search
Efficiently finds a target in a sorted array by repeatedly halving the search range.
📄️ Jump Search
Jumps ahead in fixed-size blocks on a sorted array, then performs a linear scan within the block.
📄️ Exponential Search
Finds a range by doubling the index, then performs binary search within that range. Ideal for unbounded or infinite sorted arrays.