Implementations · Cost comparisons
ADT Explorer
Compare lists, stacks, queues, maps, sets, and priority queues across implementations.
Open labExplore · Step through · Practice
Data Structures & Algorithms Lab
Explore how algorithms work, one decision at a time. Find a topic, open a demonstration, and experiment with its inputs and operations.
16 demonstrations across 7 topics
Showing all 16 demonstrations
Each lab opens in this tab.
Foundations
Explore abstract data types and ways to approach algorithmic problems.
Knapsack · Design strategies
Problem Types & Paradigms
Connect search, decision, counting, and optimization to algorithm design strategies.
Open labMisc. data structures
Explore hashing, collision handling, and storage and operation choices.
Collisions · Load factor
Hash Table Collision & Load Factor Lab
Compare chaining and linear probing, follow hash formulas, and observe resizing.
Open labTrees
Explore priority queues, search trees, traversals, and balancing.
Priority queues · Step by step
Binary Heap: Tree & Array
Generate a heap and step through tail insertion, root removal, and percolation.
Open labSearch trees · Step by step
BST & Tree Traversals
Generate random or skewed trees, then step through add, remove, search, and traversal.
Open labDSA II · LL, RR, LR & RL
AVL Rotation Lab
Explore insertion, deletion, and search with bottom-up balance checks and separate rotation steps.
Open labGraphs
Explore traversal, representation choices, and shortest-path decisions.
Queues · Call stacks · Traversal forests
BFS & DFS Graph Explorer
Follow discovery, neighbor checks, and completion using BFS and recursive DFS on the same editable graph.
Open labSparse & dense · Storage & operation costs
Graph Representation Lab
Compare adjacency matrices and lists on the same graph, then inspect edge lookups and neighbor scans.
Open labShortest paths · Priority queues
Dijkstra’s Shortest Paths
Choose a source, follow edge relaxation, and trace shortest routes in a weighted graph.
Open labSorting
Watch sorting algorithms run, or practice arranging the cards yourself.
Four algorithms · Stability
Card Sort Visualizer
Follow selection, insertion, merge, and quick sort while tracking equal-key stability.
Open labHands-on practice · Undo
Card Sorting Workbench
Reorder cards by dragging or swapping and explore sorted order, stability, and undo.
Open labAlgorithm analysis
Explore asymptotic bounds and the work performed by recursive algorithms.
O, Θ & Ω · Constants & thresholds
Asymptotic Bounds Lab
Compare growth functions and adjust bound constants while separating finite evidence from asymptotic claims.
Open labDSA II · Level costs & Master method
Divide & Conquer Recurrence Tree
Expand recursive levels, inspect subproblem work, and connect the exact sum with its asymptotic growth.
Open labCase studies
Start with a specific problem and compare algorithm choices and solution strategies.
Compression · Prefix codes
Huffman Coding
Build a prefix-code tree through successive merges, inspect codes, and encode a message.
Open labPacking heuristics · Online & offline
Bin Packing
Compare online packing rules with decreasing-order offline variants using unit-capacity bins.
Open labDSA II · Brute force, divide & conquer, Kadane
Maximum Subarray Comparison Lab
Compare three exact algorithms with candidate intervals, call stacks, and element-sum operation counts.
Open labNo matching demonstrations
Try another keyword or clear the topic filter.