Understand algorithms, step by step

Find an element in a sorted array by halving the search space each step.

Divide in half, sort each half recursively, merge back.

Find shortest paths from a source node using a priority queue.

Compute Fibonacci numbers efficiently using memoization or tabulation.

Pick a pivot, partition around it, recursively sort partitions.

Explore all neighbors at the current depth before going deeper.