A logarithmic-time search algorithm for sorted arrays.
A graph traversal algorithm that explores vertices in layers.
A simple sorting algorithm that repeatedly swaps adjacent elements.
A graph algorithm to find the shortest path from a source to all other vertices.
An efficient and stable algorithm, based on divide and conquer paradigm.
A fast and widely used sorting algorithm based on divide and conquer.