First-Fit Decreasing animated: items sorted large-to-small drop into the first bin that fits — with the famous 11/9·OPT+1 guarantee explained.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Bin Packing Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. First-Fit Decreasing animated: items sorted large-to-small drop into the first bin that fits — with the famous 11/9·OPT+1 guarantee explained. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
Vertex Cover Approximation Visualizer: The classic 2-approximation animated: take both endpoints of uncovered edges and get a provable ≤2×OPT guarantee for an NP-hard problem.
Open tool0/1 Knapsack Visualizer: The 0/1 knapsack DP table animated cell by cell: skip-or-take decisions with the exact cells each value reads from, ending at the optimal bottom-right answer.
Open toolAlgorithm Academy: 35+ classic algorithms animated step by step — searching, counting/radix/bucket sort, dynamic programming tables, greedy, backtracking, KMP, graph algorithms, max flow, and convex hull — with auto-play, next/prev stepping, adjustable interval, and pseudocode that highlights the running line.
Open tool1Bin packing (First-Fit Decreasing): sort items descending, place each into the FIRST bin it fits; open a new bin only when none fits. NP-hard exactly — FFD uses ≤ 11/9·OPT + 1 bins, guaranteed.
sort items descendingfor each item:place in FIRST bin that fitsnone fits → open a new binbins ≤ 11/9 · OPT + 1 (proved)
Sort items largest-first and drop each into the first bin with room. NP-hard exactly; FFD's bound is one of the classic approximation results.
