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 _______________________________________________ Hugs-Users mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/hugs-users
- question about a sort algorithm Nossin, F.
- Re: question about a sort algorithm Tom Pledger
- Re: question about a sort algorithm Jeremy Gibbons
