digg

Facebook Connect Join Digg About

List of Algorithms

en.wikipedia.org — This single wikipedia webpage shows you a list of algorithms neatly classified into categories. Pick the ones you are interested in !

Who dugg this? Made popular Feb 1, 2006

Digg DudeWhat is Digg?

Digg is a place for people to discover and share content from anywhere on the web. Digg surfaces the best stuff as submitted and voted on by the community. Take the Tour to learn more.

22 Comments

show profanity settings
expand all
  • Praetorian42, on 10/12/2007, -1/+2Cool, my Dad's algorithm is in there:
    http://en.wikipedia.org/wiki/Peterson%27s_algorithm
  • colebarnes, on 10/12/2007, -0/+0nice...
    where was this when i was in college???
  • Haplo, on 10/12/2007, -0/+0"WTF. No Reed-Solomon error-correction algorithm? "

    Then add it. That's the whole idea behind wikipedia. Instead of posting a complaint on digg, *YOU* can add the ommision.

    --
    http://johnbokma.com/
  • Izanagi, on 10/12/2007, -0/+0No digg.
    I almost think they should block wikipedia sites...I look there for everything anyhow.
  • TiMMY8765, on 10/12/2007, -0/+0awesome, this will make a nice reference for my "Algoithms and Effeciency" class
  • wbrendel, on 10/12/2007, -0/+0I don't usually digg Wikipedia pages, but this one was really cool. Thanks for posting it..
  • gaijinflyer, on 10/12/2007, -0/+0Outstanding Digg it.
  • 5blocksfree, on 10/12/2007, -0/+0Quite cool! Digg++
  • thundercleese, on 10/12/2007, -0/+0digg! Great find, thanks for posting.
  • inactive, on 10/12/2007, -0/+0WTF. No Reed-Solomon error-correction algorithm? Still a nice collection which I'm sure will come in handy.
  • Haplo, on 10/12/2007, -0/+0"I almost think they should block wikipedia sites...I look there for everything anyhow."

    I am amazed on how much time a bunch of people wastes with "insightfull" comments like this.

    I, for one, just added a few algorithms to that wikipedia page. You just sat behind your computer and farted.
  • killerCoder, on 10/12/2007, -0/+0del.icio.us!
  • konstratos, on 10/12/2007, -0/+0That's damn handy!
  • anirudhvr, on 10/12/2007, -0/+0first time i'm hearing of 'cocktail' sort - sounds just what a drunk guy could use...
  • vagabond0101, on 10/12/2007, -0/+0At the end of this page, in the "who dugg this?" section it says there are 675 diggers. And at the top of this page, it says 666 diggs. whats this?!?
  • thundercleese, on 10/12/2007, -0/+0@vagabond0101
    Strange, it is showing 706 at the bottom and 696 at the top.
  • squaat, on 10/12/2007, -0/+0@ xsolidusx

    The primary reason to use something like this is so you don't re-invent the wheel. Most of the problems that programmers face have been solved before and solved by people much smarter than yourself. A well known algorithm has stood the test of time, if you yourself tried to figure out an algorithm to solve a well known problem, the chances are that you wouldn't get it right, or it wouldn't be as efficient as the well known algorithm.

    For example. Say you have a list of names that you need to sort into alphabetical order. 1 algorithm may be to search through the list and find any names begining with A. Of those names are there any that start with AA? no? then what about Ab? Cool I've got an Abbey, so she's first on the list. Now any Ac's? etc etc

    This is quite slow and repeditive and would involve you going through the list many many times. And while it may not be a problem if your list is say 10 names, but what if your list is 1 million names?

    There is a better solution. It's an algorithm called QuickSort and it sorts the list in a much more efficient way. But when you examine the algorithm it's quite complicated and unituative. Not many people in the world could have come up with it.

    So as a programmer I see that my problem is to sort a list. So I look up a list sorting algorithm. Usually it's descibed in a way that I can easily use in my programming language of choice, and if it's a really known algorithm, I'll be able to cut and paste some source code.

    So in the end my program is more efficient, and all I did was some google searching.
  • mtrutledge, on 10/12/2007, -0/+0Awesome...Just mad my bookmarks...this will def. come in handy.
  • XsolidusX, on 10/12/2007, -0/+0I'm not a programmer. What would you guys USE this for?? I understand you guys find it useful. But give me a real life example.
  • vagabond0101, on 10/12/2007, -0/+0Now it is 720(bottom) and 709(top).. the difference is 11. This means number of diggers is more than number of diggs.. how can this happen?
    I think if someone does "blog this" he/she is counted as a digger but number of diggs doesnt increase.
    What say u?
  • Arcotik, on 10/12/2007, -2/+0Wow...absolutely useless.

  • Add a Comment

    Login or register to comment!
    Or, sign-in super fast with your Facebook account ...


© Digg Inc. 2009 — Content created and posted by Digg users is dedicated to the public domain | Terms of Use Updated | Privacy Policy
DIGG, DIGG IT, DUGG, DIGG THIS, Digg graphics, logos, designs, page headers, button icons, scripts, and other service names are the trademarks of Digg Inc.