en.wikipedia.org— This single wikipedia webpage shows you a list of algorithms neatly classified into categories. Pick the ones you are interested in !
Feb 1, 2006View in Crawl 4
Now 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?
@ xsolidusxThe 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 etcThis 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.
anirudhvrFeb 1, 2006
first time i'm hearing of 'c**ktail' sort - sounds just what a drunk guy could use...
izanagiFeb 2, 2006
No digg. I almost think they should block wikipedia sites...I look there for everything anyhow.
konstratosFeb 2, 2006
That's damn handy!
vagabond0101Feb 2, 2006Submitter
Now 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?
xsolidusxFeb 2, 2006
I'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.
squaatFeb 3, 2006
@ xsolidusxThe 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 etcThis 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.
mtrutledgeFeb 3, 2006
Awesome...Just mad my bookmarks...this will def. come in handy.