ā† Back to Home

Data Structures & Algorithms

Master fundamental algorithms through visualization. Step through sorting algorithms, explore data structures, and understand how they work under the hood.

String Operations

String Operations

Reverse, palindrome, anagram, substring search

BeginnerO(n)
Try it ā†’
Array Operations

Array Operations

Explore append, insert, delete, search, and update

BeginnerO(1) - O(n)
Try it ā†’
Bit Manipulation

Bit Manipulation

Bitwise operations: AND, OR, XOR, shifts, and bit tricks

IntermediateO(1)
Try it ā†’
Recursion

Recursion

Soon

Factorial, Fibonacci, Tower of Hanoi visualized

IntermediateO(2^n)
Stack (LIFO)

Stack (LIFO)

Last In First Out - push, pop, and peek operations

BeginnerO(1)
Try it ā†’
Queue (FIFO)

Queue (FIFO)

First In First Out - enqueue, dequeue, and peek operations

BeginnerO(1)
Try it ā†’
Bubble Sort

Bubble Sort

Watch elements bubble to their correct positions

BeginnerO(nĀ²)
Try it ā†’
Insertion Sort

Insertion Sort

Build sorted array by inserting elements one by one

BeginnerO(nĀ²)
Try it ā†’
Selection Sort

Selection Sort

Repeatedly select minimum and place at beginning

BeginnerO(nĀ²)
Try it ā†’
Merge Sort

Merge Sort

Divide and conquer with guaranteed O(n log n)

IntermediateO(n log n)
Try it ā†’
Quick Sort

Quick Sort

Visualize partitioning and recursion

IntermediateO(n log n)
Try it ā†’
Heap Sort

Heap Sort

Sort using binary heap data structure

AdvancedO(n log n)
Try it ā†’
Binary Search Tree

Binary Search Tree

Interactive tree operations and traversals

IntermediateO(log n)
Try it ā†’