Data Structure Visualizations (2011)

https://www.cs.usfca.edu/~galles/visualization/Algorithms.html

by prabhupant • 7 years ago

384 33 7 years ago

cs.usfca.edu

nift• 7 years ago

Interesting site! Always cool to see these things visualised.

It reminds me of the visualisation of different sorting algorithm (with sound): https://youtu.be/kPRA0W1kECg

winrid• 7 years ago

Very cool! Always fun to watch all the different tree implimentations.

abhishekjha2• 7 years ago

Query regarding Preparing for interviews: Is it expected from me to know implementations for all of them with all the posdible operations?

gamanoid• 7 years ago

In some way yes, especially when looking at comparing their time/memory complexities and weighing tradeoffs.

A good starter would be to go through the classic: Cracking The Coding Interview book as a form of guide.

Also there are a few sites out there that offer practical contextual problems to solve in preparation.

Interview questions vary and how stringent they will be with it would also vary.

anonytrary4• 7 years ago

All of them? No. The basic ones? Yes. You should know how to implement a stack, queue, linked list, doubly-linked list, heap, and binary tree. You should also know how to represent a tree in binary form. You should know how to balance a binary tree. You should know the time and space complexity of common operations on those structures. Do they expect you to build a skip-list from scratch on a whiteboard? Probably not, and they shouldn't. If you're very familiar with the basics, then implementing more advanced structures is a matter of doing some basic Googling.

zimpenfish3• 7 years ago

You should know how to implement a stack, queue, linked list, doubly-linked list, heap, and binary tree.

Not once in the last 20 years have I had to use one of those that wasn't already implemented for me. Nor, I suspect, have most people. It's like requiring a delivery driver to know the internals of engines - completely unnecessary to getting the day to day work done.

abhishekjha2• 7 years ago

I know the basic ones. I was asked to do inorder traversal with some other requirements which I think I did. I was also asked to write correct code for finding connected components on a paper which I kinda didn’t do so well. I think having a computer nearby would have helped me in the second problem but writing on paper seems to much for me.

PunchTornado3• 7 years ago

in the past 10 years I never had to implement a linked list in any of my jobs. is this anormal?

bradleyjg2• 7 years ago

A interviewer that asks you to implement a non-trivial data structure is a bad interviewer that should feel bad about himself. Unless you are going for a job on the BCL team or something.

However, you definitely should be familiar with all the basic and many of the intermediate data structures, their asymptotic behaviors (bonus points if you can say something about their cache friendliness), and where you might use them.

anta40• 7 years ago

What's a BCL team?

anonytrary4• 7 years ago

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.

DyslexicAtheist3• 7 years ago

maybe it's time to mark bubble-sort with a latin-cross (deprecated) too[1][2]

[1] https://users.cs.duke.edu/~ola/bubble/bubble.html

[2] also bubble sort is shapeist and efficiency-shaming :)

DyslexicAtheist3• 7 years ago

QuickSort with Hungarian (Küküllőmenti legényes) folk dance: https://www.youtube.com/watch?v=ywWBy6J5gz8

rafascar• 7 years ago

This is amazing

jancsika• 7 years ago

You know, in some cultures I'd assume a computer scientist paid a bunch of folk dancers, slapped numbers on them, and and taught them this pattern to have a laugh with other computer scientists.

But knowing Hungarians, I bet all these folk dancers have math/physics/compsci degrees and had to draw straws to decide whose interpretation of quicksort to choose.

DyslexicAtheist3• 7 years ago

I picture them all during break time playing with their rubik cubes

amelius• 7 years ago

How well can it visualize arbitrary graphs of various types (trees, DAGs, undirected graphs, cyclic graphs, ...)?

dang• 7 years ago

2013: https://news.ycombinator.com/item?id=6928904

2015: https://news.ycombinator.com/item?id=10183811

2017: https://news.ycombinator.com/item?id=14064865 https://news.ycombinator.com/item?id=15480517

olooney• 7 years ago

Some very nice ones in here: AVL and Red/Black trees, especially the rotation step. I also liked it when the code shows up on the upper left and you can see it stepping through line-by-line, such as the Fibonacci example.

The radix tree didn't seem to work for me.

elderK• 7 years ago

Man, I'll always have a soft spot in my heart for these visualizations.

Extremely useful learning aids :)

I remember back in the day when they were Java applets :)

Data Structure Visualizations (2011)

Related Stories