roy@ms.uky.edu (Kill Roy) (03/26/90)
Hello,
I am getting ready to put a sorting routine on my 28S,
and I was wondering if anyone had any strong opinions
about the best one for the following conditions:
1) At most 1000 items (reals or strings) in an array or list.
2) In memory sorting (I've heard it is very wasteful to
handle large arrays and lists on the stack).
3) Minimal memory overhead.
a) The sorting routine code should be much less than
1K.
b) The sorting space required during execution should
be much less than the size of the array or list.
4) Reasonable speed (I don't want to wait more than 30
minutes to sort a 1000 element array).
I figured either 'Quicksort' or 'Shellsort' would be best,
but I'm a novice at HP programming, so I really can't
anticipate any advantages or disadvantages. Any comments
would be appreciated.
Thanks,
Roy
--
email roy@ms.uky.edu || roy@ukma.bitnet || {rutgers,uunet}!ukma!roy