Keith Devens .com |
Saturday, August 30, 2008 | ![]() |
| I would rather be an optimist and be wrong than a pessimist who proves to be right. The former sometimes... – "Hoots" | ||
|
| ← Iwo Jima, if covered by media today, by Zell Miller | How to Study: A Brief Guide → |

Keith Gaughan (http://talideon.com/) wrote:
Keith (http://keithdevens.com/) wrote:
I didn't post this before, though I'm pretty sure I first came across it a while ago on your site, actually. Since you've moved around I didn't bother looking for the original link, though maybe I broke the rules on hat tips.
Keith Gaughan (http://talideon.com/) wrote:
No you didn't, so don't worry. It's just that the link struck me as being way too familiar.
It's a cool little algorithm. I ought to check it to see if it's generally more efficient than the other simple n^2 search algorithms like Insertion Sort. It's good to have a nice, simple algorithm that you can keep in your head for the times that the library and OS algorithms don't make any sense and you're sorting small amounts of data.
Keith (http://keithdevens.com/) wrote:
I ought to check it to see if it's generally more efficient than the other simple n^2 search algorithms like Insertion Sort.
If you do, let me know what results you get. A few years ago, I implemented a bubble sort in ASP because ASP (vbscript) doesn't have sorting built in. I would have been happy to use Gnome sort instead 
For future reference, here are two quicksort algorithms in vbscript that I probably could have used instead assuming they existed at the time.
Feel free to post a comment below. Please see my comment policy.
Formatting Rules (No HTML):
Generated in about 0.182s.
(Used 8 db queries)

Haven't you posted that up before, or am I just remembering something I did..?