Algorithms & Data Structures
Step-by-step interactive animations, algorithmic state transitions, and zero-dependency multi-language reference implementations.
Quick Search
Categories
All Topics
12Data Structures
Sorting Algorithms
Searching Algorithms
Big-O (Worst Case) Filter
Engine Features
• Interactive Step-by-Step Stepper
• TypeScript, Java, Python Reference
• Real-time LIFO/FIFO Pointer Chains
Showing:
12 items foundData Structures
4Stack
Data StructureLIFO (Last-In, First-Out) collection supporting O(1) push, pop, and peek operations.
Worst Insert
O(1)
Worst Search
O(n)
Space
O(n)
Queue
Data StructureFIFO (First-In, First-Out) collection supporting O(1) enqueue and dequeue operations.
Worst Insert
O(1)
Worst Search
O(n)
Space
O(n)
Singly Linked List
Data StructureUnidirectional chain of nodes where each element points to the next in sequence.
Worst Insert
O(1)
Worst Search
O(n)
Space
O(n)
Doubly Linked List
Data StructureBidirectional chain of nodes containing pointers to both next and previous elements.
Worst Insert
O(1)
Worst Search
O(n)
Space
O(n)
Sorting Algorithms
6Bubble Sort
SortingRepeatedly swaps adjacent elements that are in the wrong order.
Worst
O(n²)
Avg
O(n²)
Space
O(1)
Selection Sort
SortingFinds the minimum element and places it at the beginning each pass.
Worst
O(n²)
Avg
O(n²)
Space
O(1)
Insertion Sort
SortingBuilds the sorted array one element at a time by inserting each into its correct position.
Worst
O(n²)
Avg
O(n²)
Space
O(1)
Merge Sort
SortingDivides the array in half, sorts each half, then merges them back together.
Worst
O(n log n)
Avg
O(n log n)
Space
O(n)
Quick Sort
SortingPicks a pivot and partitions the array into elements less than and greater than it.
Worst
O(n²)
Avg
O(n log n)
Space
O(log n)
Heap Sort
SortingUses a max-heap data structure to repeatedly extract the largest element.
Worst
O(n log n)
Avg
O(n log n)
Space
O(1)