I didn't find this very funny.

On to the topic: the site itself has several connections to spam/malware-like sites, including a free blogging domain, frequent use of superlatives (including the "most" in this article's title), and dissimilar formatting of the articles' content. My first guess is that the author's mixing random stuff (and copying from many other articles, at least some chunks of text look like copied from those of Wikipedia). Better not trust these sites too much...

Of course, the claim that those are (some of or exactly) the most famous is ridiculous. The very view on "famous" algorithms is based on how often we encounter them and how early we heard of them when learning algorithmic programming. Ergo, it's totally subjective.

For example, I wouldn't even consider Towers of Hanoi a special algorithm — at most, I'd put it into "Recursion", if there was such a section there (which I don't really consider algorithmic, more like a clever use of a feature of common programming languages). On the other hand, Dijkstra's algorithm is one of the first ones that come to my mind when reading the title, while it (and other graph theory algos) don't appear there at all.

Not to say the article can't list famous algorithms, but that's only from the author's viewpoint — I'd say he learned most of it from school(s) and not competitions (but that's just a wild guess :D)

In fact, there are too many famous algos for one to even list them, and if you wanted to try, it'd be better to base on Wikipedia :D But the best way to learn is to encounter them.