Algorithms & Data Structures

Repeatedly swaps adjacent out-of-order elements until the list is sorted.

Selects the smallest remaining element and moves it to the front.

Inserts each element into its correct place among the already-sorted items.

Splits the array, sorts each half, then merges the sorted halves.

Partitions around a pivot, then recurses on each side.

Builds a max-heap, then repeatedly extracts the maximum.

Counts occurrences of each value, then places them in order.

Sorts digit by digit using a stable counting pass per digit.

Scans elements one by one until it finds the target.

Repeatedly halves a sorted range to zero in on the target.

Explores a graph level by level using a queue.

Explores as far as possible down each branch before backtracking.

Finds shortest paths from a source by always expanding the closest node.