Quicksort - advanced question

[Rydel]

It seems quicksort does not suit very well for large arrays. I need to manipulate certain (very large) list of words and at the end to sort them all. It works for medim-size files, but for example now I have a file of 800KB or larger with circa 120,000 words or more, then my quicksort runs out of stack. Any idea how to solve this one? To use some other algorithm? Which one will be quick enough yet not too demanding on memory? Or, maybe, I can increase the stack size during the execution?


regards,
rydel n23

http://pravapis.org/

http://rydel.net/

 

[MichaelRed]

I would suggest the "Heap" sort. You can -of course- use quicksort within the heap sort concept.





MichaelRed
m.red@att.net

Searching for employment in all the wrong places