[prev in list] [next in list] [prev in thread] [next in thread] 

List:       haskell-cafe
Subject:    Re: [Haskell-cafe] Functional counterpart of counting-sort?
From:       Nicola Gigante <nicola.gigante () gmail ! com>
Date:       2015-09-07 6:33:25
Message-ID: 5763C5DB-3285-4373-96E7-DB952F935A10 () gmail ! com
[Download RAW message or body]

Il giorno 06/set/2015, alle ore 19:36, Tom Ellis <tom-lists-haskell-cafe-2013@jaguarpaw.co.uk> ha scritto:
> 
>> 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?
> 
>    http://hackage.haskell.org/package/discrimination
> 

Well, no, I wasn't aware of it at all! Thank you!

It seems what I'm looking for!
I'll read the papers pointed in the doc, but does anyone have a few 
words to say on what "discrimination" is all about?

Greetings,
Nicola
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
[prev in list] [next in list] [prev in thread] [next in thread]