Algorithm Arena

Repeatedly swaps adjacent out-of-order elements until sorted.

Builds the sorted array one element at a time by shifting.

Selects the minimum remaining element and places it next.

Divide-and-conquer that merges sorted halves.

Partitions around a pivot and recurses on each side.

Builds a binary heap then repeatedly extracts the max.

Non-comparative sort that buckets by digit/byte.

Scans elements one by one until a match is found.

Halves a sorted range each step to locate a key.

Explores a graph level by level using a queue.

Explores as deep as possible before backtracking.

Shortest paths from a source on non-negative weighted graphs.

Heuristic-guided shortest path (Dijkstra + heuristic).

Maximises value under a weight budget via a DP table.

Minimum insert/delete/substitute edits between two strings.

Average O(1) key→value lookup via a hash function.

Linear-time substring search using a prefix table.

Ordered map with logarithmic operations when balanced.

Computes the discrete Fourier transform in O(n log n).

Symmetric encryption standard with hardware support.

Partitions data into k clusters by iterative centroid updates.