The Grey Labyrinth is a collection of puzzles, riddles, mind games, paradoxes and other intellectually challenging diversions. Related topics: puzzle games, logic puzzles, lateral thinking puzzles, philosophy, mind benders, brain teasers, word problems, conundrums, 3d puzzles, spatial reasoning, intelligence tests, mathematical diversions, paradoxes, physics problems, reasoning, math, science.

MTGAP · Daedalian Member

I am trying to write a program that requires the sorting of a list that contains about 50,000 elements, and I need an efficient sorting algorithm. I was going to use the Quicksort http://linux.wku.edu/~lamonml/algor/sort/quick.html algorithm, but I think it only works if the array of elements contains only numbers from 1 to <number of elements>, which is not the case for my program. I need an efficient algorithm that sorts an array containing any numbers, and it needs to be efficient for sorting 50,000 elements and at the same time not use up all my computer's memory. I am currently using the Shell http://linux.wku.edu/~lamonml/algor/sort/shell.html algorithm, but it seems awfully slow.[/url]
_________________
This statement is false.

wordcross · Posted: Sun Apr 12, 2009 11:45 pm Post subject: 2

quicksort shouldn't be limited to arrays of a set size. If done correctly it should use recursion to repeatedly halve whatever array you throw at it.
_________________
Has anyone really been far even as decided to use even go want to do look more like?

MTGAP · Daedalian Member

wordcross · Posted: Mon Apr 13, 2009 2:45 am Post subject: 4

no problem Revenge most foul!

_________________
Has anyone really been far even as decided to use even go want to do look more like?