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

Linear Search

Search each element sequentially

BeginnerTime: O(n)

Binary Search

Divide and search in sorted array

BeginnerTime: O(log n)

Graph Algorithms

Algorithms for traversing and analyzing graphs

Breadth-First Search

Explore all neighbors before going deeper

IntermediateTime: O(V + E)

Depth-First Search

Explore as far as possible along each branch

IntermediateTime: O(V + E)

Dijkstra's Algorithm

Find shortest path from source to all vertices

AdvancedTime: O(V² / E log V)

Dynamic Programming

Optimization algorithms that break problems into subproblems

Fibonacci

Calculate Fibonacci numbers efficiently

BeginnerTime: O(n)

Longest Common Subsequence

Find the longest subsequence common to two sequences

IntermediateTime: O(m × n)

Knapsack Problem

Maximize value with weight constraints

AdvancedTime: O(n × W)