4 ms·
Wow, what a sad place has HN become that this kind of comment is getting upvoted. There are tons of interesting stuff in there, very exhaustively commented, and
by stiff 13y ago
Wow, what a sad place has HN become that this kind of comment is getting upvoted. There are tons of interesting stuff in there, very exhaustively commented, and you say "some are interesting, lots are mundane" quoting a single goddamn example. Wouldn't linking the interesting ones be, like, more interesting? What a fucking weak attitude!
- eps 13y agoTo each his own. For some splay trees is a revelation, for others - it's Algorithms 101.
- stiff 13y agoEuclid's Algorithm is certainly Algorithms 101, his discussion of it - far from it: http://www.keithschwarz.com/interesting/code/?dir=euclid http://www.keithschwarz.com/interesting/code/?dir=euclid
- blablabla123 13y agoHave you looked at the link he provided? IMHO it doesn't fit at all with the other things. You can implement In-Place Mergesort or one of its variants by studying Wikipedia. Or you can just look up a nice implementation from the OPs site and port it to your favorite language. That said, this argmin/argmax thing does absolutely not fit.
- stiff 13y agoIt's just ONE example, and if it's really the most interesting thing HN has to say on this (it was the top comment when I responded) then it's truly a sad state of affairs. Those btw are as much tutorials as they are "nice implementations", there are lots of things pointed out in the comments that you won't easily find on Wikipedia.