Sorting
Sorting by comparing and rearranging values
Run algorithms and technical examples. Change the values and see what happens at each step.
Compare two neighbors. If the left value is larger, swap them.
Follow the comparisons and swaps that put an array in order.
Open exampleFollow the three messages a client and server exchange to establish a connection.
Open exampleChoose a sample sentence to inspect its token IDs and embedding vectors.
Open exampleSorting by comparing and rearranging values
Finding values and paths in arrays and graphs
Structures for storing and retrieving data
Traversing and maintaining hierarchical data
Dynamic programming with reusable subproblem results
Comparing local choices with globally optimal results
Searching by testing constraints and undoing choices
Connections, paths, and minimum costs in graphs
Algorithms for finding patterns in text
Network layers and TCP connection messages
GPU memory layout and data connections
Containers, images, networking, and storage
Event storage, distribution, replication, and offsets
Branch integration and change review
Pod scheduling, rollout, recovery, and resource management
Workflow execution, retries, replay, and durable waits
Computation from token processing to generation
Numeric distributions and leading-digit frequencies
Comparing clock measurements under relative motion