Computer Science

Sorting Algorithms

Visualizing how data is ordered.

A* Pathfinding

Finds the shortest path on a grid using heuristics.

Binary Search

Finding elements in sorted data by halving the search space.

Dijkstra's Algorithm

Finding the shortest path in a weighted graph by greedily exploring the nearest unvisited node.

Graph Traversal (BFS/DFS)

Visualize how Breadth-First and Depth-First Search algorithms navigate through graph data structures.

Convex Hull

Convex Hull

Dynamic Programming

Dynamic Programming

Finite State Machine

Finite State Machine.

Stack & Queue

Fundamental linear data structures enforcing LIFO and FIFO access patterns.

Tree Traversal

Tree Traversal

Heap & Priority Queue

Heap & Priority Queue.

Linked List Operations

Visualize dynamic memory allocation through node insertion, deletion, and traversal.

RSA Encryption

Visualizes RSA key generation, modular exponentiation, and the flow between public and private key encryption/decryption.

Topological Sort

Visualize Kahn's algorithm and DFS for finding linear orderings of directed acyclic graphs.

Regular Expression Engine

Visualize how regular expressions are parsed and evaluated against text strings.

Trie (Prefix Tree)

Visualize string insertion, exact matching, and prefix search operations within a Trie data structure.

AVL Tree Rotations

Visualize self-balancing binary search trees through balance factors and rotations.

Bloom Filter

Visualize Bloom Filter element insertion, hash function mapping, and false positive probability.

Floyd-Warshall Algorithm

Visualize the dynamic programming approach to finding shortest paths between all pairs of vertices in a weighted graph.

Huffman Coding

Visualize character frequencies, tree building, and prefix-free encoding.

LRU Cache

Visualize the Least Recently Used (LRU) cache eviction policy.

Minimum Spanning Tree

Visualize Kruskal's algorithm finding the minimum spanning tree of an edge-weighted graph.

Red-Black Tree

Visualize self-balancing binary search trees through nodes and recoloring.

Skip List

Visualize multi-level linked list operations with probabilistic balancing.

Union-Find (Disjoint Set)

Visualize how the Union-Find data structure efficiently tracks and merges disjoint sets.

B-Tree Visualization

Visualize B-Tree node splitting, key insertion, and tree balancing with customizable degree parameters.

Knapsack Problem

Optimize resource allocation by maximizing total value within a given weight capacity constraint.

Network Flow (Max-Flow)

Visualize how the maximum flow in a network is calculated using augmenting paths.

Rabin-Karp String Search

Visualize the rolling hash and matching process of the Rabin-Karp algorithm.

Segment Tree

Visualize how segment trees enable efficient range queries and point updates in logarithmic time.

Bellman-Ford Algorithm

Visualize the shortest path algorithm that handles negative edge weights by relaxing all edges in V-1 iterations.

Consistent Hashing

Visualize consistent hashing with virtual nodes for distributed caching and load balancing.

K-D Tree

Visualize the construction of a K-D tree and nearest neighbor search in 2D space.

Radix Sort

Visualize how integer arrays are sorted digit by digit using counting sort as a subroutine.

Suffix Array

Visualize suffix sorting, lexicographical ordering, and efficient substring searching using an array of suffix indices.