[Haskell-beginners] computing percentile

[Dennis Raddle]

I'm not sure if you considered duplicate elements. I came up with this
(which handles duplicates by averaging the percentile position of the first
index of the element in the sorted list and the last index of the element.
How one handles duplicates may be arbitrary or dependent on the deeper
problem). Also for my problem I wanted the maximum percentile to be 1
rather than (N-1)/N but that may just depend on your definition.

import qualified Data.List as L

toPercentile inp = map doValue inp
  where
    sorted = L.sort inp
    len = length inp
    perc idx = fromIntegral idx / (fromIntegral len - 1)
    doValue x = case L.elemIndices x sorted of
      [i] -> perc i
      is -> ((perc (head is)) + (perc (last is)))/2


On Mon, Oct 1, 2012 at 4:28 PM, Nick Vanderweit
<nick.vanderweit at gmail.com>wrote:

> Here is my implementation, which sorts the list of values. If there are N
> values, the first gets a percentile of 0/N, the second gets 1/N, and so
> on, so
> that the last value gets a percentile of (N-1)/N. It then generates the
> percentiles list from this mapping.
>
> import Data.List (sort)
> import Data.Maybe (fromJust)
> toPercentile xs =
>     let pairs = zip (sort xs) .
>           map (/(fromIntegral $ length xs)) . map fromInteger $ [0..]
>       in map (fromJust . (flip lookup) pairs) xs
>
>
> Nick
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/beginners/attachments/20121001/bef0af87/attachment-0001.htm>