Is there a library available in Hugs with an implementation for radix sort most significant??? thanking everybody in advance Freek Nossin student Computer Science at the TUE (Technical University of Eindhoven (Holland))
Nossin, F. writes:
Is there a library available in Hugs with an implementation for radix sort most significant???
I don't see one there. Bucket sort (the one with an array of booleans, indexed by the values you're sorting) can be implemented in 2-3 lines, if that helps... Hint: use accumArray. Regards, Tom
Is there a library available in Hugs with an implementation for radix sort most significant???
A derivation of one is presented in my paper "A Pointless Derivation of Radixsort", JFP 9(3) p339-346, 1999 (and accessible from my homepage, URL below). Jeremy -- Jeremy.Gibbons@comlab.ox.ac.uk Oxford University Computing Laboratory, TEL: +44 1865 283508 Wolfson Building, Parks Road, FAX: +44 1865 273839 Oxford OX1 3QD, UK. URL: http://www.comlab.ox.ac.uk/oucl/people/jeremy.gibbons.html
participants (3)
-
Jeremy Gibbons -
Nossin, F. -
Tom Pledger