Searching Algorithms

Scan through each element one by one until the target is found

Repeatedly divide a sorted array into halves, narrowing search range

Search by jumping ahead fixed steps, then linear search in block

Improved binary search for uniformly distributed sorted arrays

Find range by exponential jumps, then binary search within range

Divide sorted array into three parts, search in relevant segment

Uses Fibonacci numbers to divide array, similar to binary search

Direct access using hash function for key-value lookups

Linear search through nodes rather than array indices

Traverse down tree based on value comparisons

Breadth-First and Depth-First Search in graph structures