TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Data Structure Visualizations

514 点作者 n008超过 11 年前

20 条评论

gavinpc超过 11 年前
I dream of a world where this is built in everywhere that I write expressions. It&#x27;s so hard, and we desperately need it. Bret Victor has called a lot of attention to this lately, and rightly so.<p>It&#x27;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 the need for context, different execution environments, etc, all make this difficult to tackle generally.<p>More and more lately, I find that I&#x27;m interested in <i>this problem</i> more than the code itself.
评论 #6929795 未加载
评论 #6929506 未加载
评论 #6930061 未加载
评论 #6932471 未加载
评论 #6932944 未加载
评论 #6929551 未加载
lelandbatey超过 11 年前
As someone who just finished a datastructre class (as in had my final just a few days ago) I used the heck out of this site all semester long!<p>The visualization for B-trees and Red&#x2F;black trees was totally invaluable!
评论 #6930160 未加载
gregfjohnson超过 11 年前
I wrote a web site <a href="http://gregfjohnson.com/redblackbuilder.html" rel="nofollow">http:&#x2F;&#x2F;gregfjohnson.com&#x2F;redblackbuilder.html</a> that takes interactive algorithm visualization another step. I would be delighted and appreciative if people go check it out and provide thoughts and feedback. IMHO It is fun and informative to play with, and a great tool for learning the algorithms.<p>It is specific to red-black trees, but I am considering adding other data structure manipulation algorithms as well.<p>On insert and delete, you can single-step forward and backward and see the tree manipulations at each step. Or, you can do the entire operation at once.<p>There is pseudo-code for insert and delete, and at each forward or backward step the line of code being executed is highlighted.
capkutay超过 11 年前
This was pretty valuable when I took algorithms from this professor. Things like mergesort and indexing in B+ trees can seem very abstract when you try to learn it via a snippet of java code. These visualizations are even more useful if you need a refresher on algorithms for job interviews.
satyampujari超过 11 年前
This is so useful. Here&#x27;s another <a href="http://www.sorting-algorithms.com/" rel="nofollow">http:&#x2F;&#x2F;www.sorting-algorithms.com&#x2F;</a>
评论 #6930336 未加载
FrankenPC超过 11 年前
Wow, this is valuable. It&#x27;s not the kooky new framework that rockets tech forward, it&#x27;s tools like this.
wijt超过 11 年前
There are some great visualisations here. Coming up with good visualisations is tricky. I can&#x27;t help but mention my own attempt at a more general framework for algorithm visualisation: <a href="http://will.thimbleby.net/algorithms/" rel="nofollow">http:&#x2F;&#x2F;will.thimbleby.net&#x2F;algorithms&#x2F;</a>
评论 #6939984 未加载
评论 #6934040 未加载
olegstepanov超过 11 年前
We did similar stuff 12 years ago when I was an undergrad at SpbITMO. The website with the visualisers (in Russian) can be found here: <a href="http://rain.ifmo.ru/cat/view.php/vis" rel="nofollow">http:&#x2F;&#x2F;rain.ifmo.ru&#x2F;cat&#x2F;view.php&#x2F;vis</a>
wlievens超过 11 年前
You should check Amit Patel&#x27;s blog articles, they are chuck full of interactive visualisations that are really well executed.
评论 #6940744 未加载
enjalot超过 11 年前
I just wish there was a button in each example that would populate with some demo data. I like to watch something go and then figure out it out by playing with the parameters. From this I don&#x27;t immediately know what kind of inputs and outputs to use&#x2F;expect (integers? floats? strings?).<p>very sweet project tho!
antonius超过 11 年前
Glad I found this to reiterate what I learned as my Data Structure exam is tomorrow :)
GowGuy47超过 11 年前
Just found out yesterday that I&#x27;ll be having my first interview for a Google Software Engineering position in about a month. This is truly going to be invaluable, thank you!
mmanfrin超过 11 年前
This is incredibly useful, as someone who is an engineer with a non-technical degree.<p>Ironically (or perhaps coincidentally), I got my non-technical degree from the very school this is hosted on.
deletes超过 11 年前
Took a quick look at their insertion sort algorithm. It looks wrong, doing unnecessary swaps, when moving elements up. For and extra O(1) memory your can avoid that.
nu2ycombinator超过 11 年前
I always had hard time learning algorithms through visualization softwares. Most effective way for me was reading and visualizing in my mind.
crncosta超过 11 年前
Amazing! thanks for share.
srchit超过 11 年前
Awsome!! One of the best visualizations, I came across
ananth99超过 11 年前
Thank you for this priceless resource.
alixaxel超过 11 年前
Lovely!!
lisptime超过 11 年前
thanks for sharing