[Haskell-cafe] Functional counterpart of counting-sort?

Tom Ellis tom-lists-haskell-cafe-2013 at jaguarpaw.co.uk
Sun Sep 6 17:36:36 UTC 2015

On Sun, Sep 06, 2015 at 07:29:23PM +0200, Nicola Gigante wrote:
> Do any of you know if it is possible to sort a _list_ of integers in
> O(n) time in a (lazy) purely functional language?

Are you familiar with discrimination?


More information about the Haskell-Cafe mailing list