12 ms·
Dictionary of Algorithms and Data Structures
- dang 3y agoRelated: Dictionary of Algorithms and Data Structures (1998) - https://news.ycombinator.com/item?id=12758176 https://news.ycombinator.com/item?id=12758176 - Oct 2016 (18 comments) Dictionary of Algorithms and Data Structures - https://news.ycombinator.com/item?id=8905348 https://news.ycombinator.com/item?id=8905348 - Jan 2015 (4 comments) Dictionary of Algorithms and Data Structures - https://news.ycombinator.com/item?id=5525893 https://news.ycombinator.com/item?id=5525893 - April 2013 (15 comments) Dictionary of Algorithms and Data Structures - https://news.ycombinator.com/item?id=2496539 https://news.ycombinator.com/item?id=2496539 - April 2011 (16 comments) Dictionary of Algorithms and Data Structures - https://news.ycombinator.com/item?id=2351074 https://news.ycombinator.com/item?id=2351074 - March 2011 (1 comment)
- yeahwhatever10 3y agoAlways appreciate these historical references.
- xyzelement 3y agoI don't know if an alphabetical list of algos is a good starting point for a learner. For someone who is either starting out or wants to confidently master the topic, this classic book is the way to go.[1]. I also think this is your best lever to leveling up as a dev and crushing faang coding interviews if that's your goal. [1] https://books.google.com/books/about/Introduction_To_Algorithms.html?id=NLngYyWFl_YC&printsec=frontcover&source=kp_read_button&hl=en&newbks=1&newbks_redir=0&gboemv=1&ovdme=1#v=onepage&q&f=false https://books.google.com/books/about/Introduction_To_Algorit...
- tomrod 3y agoProbably not. But its wonderful for a reference.
- tomrod 3y agoNIST is a treasure trove. Thanks gballan for posting!
- JSavageOne 3y agoThis is a great resource, but I wish data structures & algorithms courses would focus more on applications. I'm more interested in knowing why a data structure is useful and in what context I should reach for one, vs. simply knowing what it is.
- denvaar 3y agoKnowing the context and history definitely makes it more interesting and usually helps in learning too.
- 3abiton 3y agoI think Skiena had a good course on it
- dpflan 3y agoAre you referring to this? https://www3.cs.stonybrook.edu/~skiena/373/videos/ https://www3.cs.stonybrook.edu/~skiena/373/videos/
- bobthepanda 3y agoHe was a great professor. Fun assignments that actually incentivized learning the material. E.g. Write a platform agnostic backtrack algorithm, and fastest 3 in the course got extra credit.
- dpflan 3y agoThis looks like what the OP may want from the suggested reference: https://www.algorist.com/algorist.html https://www.algorist.com/algorist.html ...
- eru 3y agoHis book, the Algorithm Design Manual, gets a lot of praise. But I found it far too fluffy, and lacking in rigor. And he doesn't even do a good job of talking about applications. https://www.redblobgames.com/ https://www.redblobgames.com/ is a really good resource that gives a lot of context, and doesn't shy away from technical details.
- ranting-moth 3y agoI wonder if they have any good random numbers I could use for my encryption algorithm?
- darklycan51 3y agoWow, this is pretty useful, thanks!
- hughdbrown 3y agoI want to love this but it is missing things that I know of: - Fenwick tree - union-find algorithm / data structures Here is where I first saw Fenwick trees: https://www.youtube.com/watch?v=uSFzHCZ4E-8&t=479s https://www.youtube.com/watch?v=uSFzHCZ4E-8&t=479s I think this is where I saw union-find: https://www.youtube.com/watch?v=PGZ64ob440I https://www.youtube.com/watch?v=PGZ64ob440I Except I remember a dictionary/hashmap implementation, not a fixed size array.
- kadoban 3y agoIt does seem to be missing quite a bit. I was sure Fenwick had to be there under another name, but I don't see it. Union-find is an even weirder miss, that's a _great_ data structure and very useful. I couldn't think of any other term it'd be hiding under. The few I couldn't find off the top of my head: square-root decomposition, heavy-light decomposition and really anything at all on Range Minumum Query, one of my favorite general problems (IMO far more interesting than sorting as a group of techniques to focus some time on). > I think this is where I saw union-find: https://www.youtube.com/watch?v=PGZ64ob440I https://www.youtube.com/watch?v=PGZ64ob440I Except I remember a dictionary/hashmap implementation, not a fixed size array. I think you usually see ufds on fixed arrays because it makes the algorithm analysis a bit more interesting. If you have lookups cost more than O(1) I think you'll wash out the fun parts of the analysis. The ds still works well of course regardless.
- xtiansimon 3y ago“… was sure Fenwick had to be there under another name.” Surely any ‘dictionary’ worth its salt would have cross references.
- eru 3y agoIt's a very finite collection, obviously almost everything will be missing. That's inevitable. Eg they don't have a soft heap or a finger tree either. They are also missing many purely functional data structures that eg Okasaki talks about.
- goliathDown 3y ago/dads/ Somethin about this just makes me smile. Nice site
- kingforaday 3y agoI like don't care.
- kingforaday 3y agoFor those unaware (inc the down voters): don't care[1] is a condition used in an output cell in karnaugh maps. The parent comment is my attempt at a play on words. 1. https://xlinux.nist.gov/dads/HTML/dontcare.html https://xlinux.nist.gov/dads/HTML/dontcare.html
- wolverine876 3y agoHa ha. If you have to explain it, the audience isn't worth your time! :)
- Nevermark 3y agoOr you haven’t given the audience enough to infer your point.
- macintux 3y agoYou’ll typically get downvoted for a comment like that even by people who catch the reference. HN tries hard not to be Reddit.
- tucnak 3y agoDon't worry about silly numbers on the internet; self-respect is infinitely more valuable
- la64710 3y agoThis is just awesome … I hope it survives all the budget cut etc. let’s archive it.
- alhirzel 3y agoI wish they took pull requests. "Acceleration structure" is a basic one that's missing.
- rippeltippel 3y agoOne notable entry: Marlena https://xlinux.nist.gov/dads/HTML/marlena.html https://xlinux.nist.gov/dads/HTML/marlena.html Does anyone know what it is about?
- notThrowingAway 3y agoProbably just a guy who really loved his wife. This one also references the name: https://xlinux.nist.gov/dads/HTML/antisymmetric.html https://xlinux.nist.gov/dads/HTML/antisymmetric.html
- maaaaattttt 3y agoI have a tangential question to this: how would one go about doing the reverse search of this list. For example I have this algorithm that I know about, I could describe how it works roughly but I don’t know its name and want to know if it’s in the list. Maybe nowadays write a pseudo code version of it, give it to chatGPT and ask for the name of it… otherwise I don’t know
- lordnacho 3y agoYou go on a discord and ask, someone will tell you.
- bjt12345 3y ago[flagged]