All Algorithms
Explore and learn different algorithms through interactive visualizations
Sorting Algorithms
Algorithms that arrange elements in a specific order
Bubble Sort
Compare and swap adjacent elements repeatedly
BeginnerTime: O(n²)
Selection Sort
Find minimum and place at the beginning
BeginnerTime: O(n²)
Insertion Sort
Insert each element into its correct position
BeginnerTime: O(n²)
Quick Sort
Divide and conquer using pivot partitioning
IntermediateTime: O(n log n)
Merge Sort
Divide, sort, and merge subarrays
IntermediateTime: O(n log n)
Heap Sort
Sort using a binary heap data structure
AdvancedTime: O(n log n)
Searching Algorithms
Algorithms that find elements in data structures
Graph Algorithms
Algorithms for traversing and analyzing graphs
Dynamic Programming
Optimization algorithms that break problems into subproblems