Explore 8+ algorithms with interactive visualizations
Sorting
Elementary sorting algorithm that repeatedly steps through the list
Time
O(n²)
Space
O(1)
Algorithm that selects the minimum element and places it at the beginning
Builds the sorted array one item at a time
Divide-and-conquer sorting algorithm using merge operations
O(n log n)
O(n)
Searching
Efficient search algorithm on sorted arrays
O(log n)
Basic search algorithm that checks every element
Graph
Depth-first search for graph exploration and traversal
O(V + E)
O(V)
Breadth-first search for shortest path and level-order traversal