Data Structures & Algorithms Course Hub

Explains the universal two-stage problem pipeline connecting Enumeration to Search, Decision, Counting, and Optimization. Features an interactive 0/1 Knapsack sandbox and combinatorial explosion analysis.

• Interactive Sandbox: 4-item Knapsack (Weight ≤ 5 kg) evaluated across 5 problem types.
• Combinatorial Analysis: Why enumeration fails for large inputs ($2^{50} \approx 10^{15}$).
• Compatibility Matrix: How 6 major algorithmic paradigms fit each problem type.

Comprehensive exploration of 7 core Abstract Data Types (List, Stack, Queue, Deque, Map, Set, Priority Queue) across candidate data structure implementations with step-by-step cost accounting.

• Learn Mode: Single-ADT visualization with operation step counts and visual analogies.
• Head-to-Head: Side-by-side implementation comparison for the same operation workload.
• Cheat Sheet & Quiz: Summary table of $\Theta$-bounds and 10 scenario-based questions.

Step-by-step and auto-play visualization of Selection, Insertion, Merge, and Quick Sort. Realistic playing cards with subscript tags prove relative order stability or demonstrate inversion.

• Stability Verification: Equal-rank cards tagged $A, B, C$ track relative order in real time.
• Visual Partitions: Shaded sorted-zone boundary and auxiliary merge buffer row.
• Presets & Speed: Random, Nearly Sorted, Reversed, and Many Duplicates.

Hands-on sorting practice allowing students to manually reorder cards using drag-and-drop or discrete two-card swaps, testing their intuition before observing algorithmic execution.

• Tactile Manipulation: Drag-and-drop along the line or click two cards to execute a parabolic swap.
• Live State Validation: Instant feedback when array is fully sorted and checks stability.
• Full Undo Stack: Step backwards through up to 30 moves with move-counter tracking.

Interactive shortest-path tree construction on a weighted graph. Features arbitrary source vertex selection, synchronized Priority Queue relaxation, step-by-step state tracking, and click-to-trace shortest path.

• Priority Queue Dynamics: Synchronized PQ table updates after each edge relaxation.
• Crisp Canvas Rendering: High-DPI line art with node status states (Unvisited, Evaluating, Visited).
• Shortest Path Tree: Edge highlighting and click-to-trace shortest route from the source.