The specimen shelf
Five live specimens. One open workbench. Choose a live plate, open a field note, or start blank. Every bench is runnable; field cards are honest about the specimens that are not.
Specimens Least Label Towns quote travel times; some estimates become final. graph dijkstra Arrival Order Work waits for inputs; the order of arrival changes what is reachable. graph bfs dfs topological Halving Horizon A sorted shelf; each question should halve the uncertainty. array binary-search Order Rack A rack must become ordered; the comparison pattern is the story. array merge-sort quick-sort Prefix Loom Two texts on axes; each cell reconciles a prefix pair. grid edit-distance lcs Start a blank plate An empty mount to invent a specimen on. Graph Array Table
Saved branches 0 / 30 Manage Branches you keep appear here, newest first.
Reader benches Benches you save while working appear here.
Field index 24 algorithm 0/1 Knapsack algorithm Bellman–Ford algorithm Bipartite Matching algorithm Coin Change algorithm Fixed-Point Iteration algorithm Floyd–Warshall algorithm Huffman Coding algorithm Karatsuba Multiplication algorithm Longest Increasing Subsequence algorithm Maximum Flow algorithm Minimum Spanning Tree algorithm Newton's Method algorithm Stable Matching algorithm Strassen's Algorithm algorithm Union–Find study Blood Circulation study Global Supply Chains study Internet Routing study Photosynthesis study Power Grids study Sleep study The Immune System study The Office as a Computer study Urban Traffic Networks Branches0 / 30