The trailing-bit trick animated: i & −i jumps for updates and prefix sums, each covering a doubling block — ten lines of code, O(log n) everything.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Fenwick Tree (BIT) Visualizer is a free, browser-based tool that helps you tidy up and standardize messy datasets. The trailing-bit trick animated: i & −i jumps for updates and prefix sums, each covering a doubling block — ten lines of code, O(log n) everything. 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.
Clean obvious quality problems before analysis, imports, dashboards, or automation.
Review the preview, copy or download the result, and keep everything local in your browser.
Segment Tree Visualizer: Build, range-query, and update animated on a real tree — ranges tile into O(log n) blocks and updates touch only the root path.
Open toolBinary Search Tree Visualizer: Insert, delete, search, and traverse a BST, AVL tree (animated rotations with balance factors), or min-heap — every comparison narrated, every pointer move animated.
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 tool—
1Fenwick tree (Binary Indexed Tree) over [3, 4, 11, 17, 8, 6, 2, 5]: BIT[i] stores the sum of the last (i & −i) elements ending at i — the trailing-bit trick. Update and prefix-sum both O(log n) with tiny code.
BIT[i] covers (i & -i) elementsadd(i, v): while i ≤ n:BIT[i] += v; i += i & -iprefix(i): while i > 0:s += BIT[i]; i -= i & -i
Prefix sums with the trailing-bit trick: BIT[i] covers the last (i & −i) elements. Ten lines of code, O(log n) everything.
