The originally submitted URL now redirects to the address above. Updating the destination does not change the item’s HN history, Hall membership, or rank.
Submission timeline
2007–2026One slot for every year since HN launched. Height is that year's peak points; orange marks a 100+ point or 50+ comment breakout. Select a bar to open its strongest thread.
First comments on top threads
HN comment orderI dream of a world where this is built in everywhere that I write expressions. It's so hard, and we desperately need it. Bret Victor has called a lot of attention to this lately, and rightly so. It's easy to forget how much we have to remember inside our heads just to work with code. And why? Much of this work could and should be done by the machine, which would free us to focus on what we want. But…
I worked on algorithm visualizers in the past and found the effort necessary to get something better than static pictures and text to be immense. Every single combination of data structure and algorithm needs to have a semi-custom designed visualizer in order for it to be easier to understand and appealing. A human tutor can take pauses when something isn't clear, but a visualizer is forced to choose between checking for the user's understanding and not interrupting the flow. Link…
I was a bit annoyed that the visualizations require you to enter a number, then press a button, which triggers the input field to clear and disables input until the current animation is done. So if you wanna see a quick progression of building a linked list, you have to click, type, press button, repeat. It'd be neat if they queued up comma separated inputs so you could actually watch an entire sequence unfold.
Quite interesting. When playing with the B+ tree, I added about 30 values, including the same value about 3-4 times. Apparently, you cannot delete the last of those repeating values. Seems to be a bug. No wonder the B+ trees are considered as one of the most complex of widely used data structures.
The first top-level comment from each of the four biggest threads, in HN’s own order. Excerpts are shortened; open a comment for full context.
- Breakout years
- 5
- Total points
- 1801
- Total comments
- 109
100+ points or 50+ comments
reference only — not used in Hall rules or ranking
reference only — not used in Hall rules or ranking
Every submission
| Date | Title as submitted | By | Points | Comments |
|---|---|---|---|---|
| 2011-05-02 | Data Structure Visualization | fogus | 72 | 7 |
| 2013-12-18 | Data Structure VisualizationsFirst breakout · Best thread | n008 | 514 | 35 |
| 2015-03-19 | Best Data Structure Visualizations | naveen_raju | 1 | 0 |
| 2015-09-08 | Data Structure Visualizations (2011) | vinchuco | 111 | 3 |
| 2017-04-08 | Data Structure Visualizations | zengid | 4 | 2 |
| 2017-09-21 | Animated Data Structures | kahlonel | 7 | 1 |
| 2017-10-16 | Data Structure VisualizationsHall induction | imwally | 216 | 9 |
| 2019-02-05 | Data Structure Visualizations (2011) | prabhupant | 384 | 33 |
| 2021-07-06 | Data Structure VisualizationsLatest 20+ point return | yurish | 492 | 19 |
