Visually master core computer science concepts through real-time, interactive animations.
Contiguous memory locations holding elements. Supports O(1) random access.
Nodes containing data and pointers. Dynamic sizing with O(1) head insertion.
LIFO (Last-In-First-Out) structure. Supports O(1) push, pop, and peek functions.
FIFO (First-In-First-Out) structure. Features enqueue and dequeue operations.
O(log n) search algorithm that halves the search space in a sorted array.
Repeatedly swaps adjacent elements if they are in the wrong order.
Finds the minimum element and places it at the beginning.
Builds the sorted array one item at a time by inserting elements.
Divide and conquer O(n log n) recursive sorting algorithm.
Efficient divide and conquer algorithm leveraging a pivot partition.
Shunting-yard algorithm for parsing mathematical expressions.
Hierarchical structure where left children are smaller, right are larger.
Strictly height-balanced BST utilizing LL, LR, RR, and RL rotations.
Self-balancing BST utilizing coloring rules and bounds to maintain height.
Prefix tree for strings. Excellent for dictionaries and autocomplete.
Level-order graph traversal utilizing a Queue.
Branch-deep graph traversal utilizing a Stack or Recursion.
Intelligent, heuristic-based shortest pathfinding algorithm.
Makes locally optimal choices at each stage without backtracking.
Orders Directed Acyclic Graphs (DAGs) using Kahn's algorithm or DFS.