Choose one to explore step by step

Finding values and paths in arrays and graphs

Array search

Check array values one by one from the beginning.

Halve the search range by comparing the middle value of a sorted array.

Find a candidate block by jumping, then scan within that block.

Double the checked index to find a range, then binary-search it.

Estimate a target position from the values in a sorted numeric array.

Compare two positions to narrow a range divided into three parts.

Use Fibonacci numbers to choose positions within a sorted array.

Visit graph vertices in increasing distance from the start.

Explore a path deeply, then return when no unvisited neighbor remains.

Search using both accumulated cost and estimated remaining cost.