Breadth-First Search A graph traversal algorithm that explores vertices in order of distance from a source using a queue, finding shortest paths in unweighted graphs.
Binary Search An algorithm that locates a target in a sorted array in logarithmic time by repeatedly halving the search interval.