EfficientSort

Efficient sort

(added 080923)

At ICFP'08, Fritz Henglein presented a generic library of combinators to construct linear time sorting algorithms. This project is about refining that proof-of-concept library into an efficient implementation and evaluating the performance.

Generic Discrimination---Sorting and Partitioning Unshared Data in Linear Time

Background: FP (Haskell), Algorithms, Programming paradigms, Software Constraints
Number of people: 1-2
Contact: Patrik