Extension for Pearls of Functional Algorithm Design by Richard Bird,
2010, page 25 #Haskell
---
---
module SelectionProblem where
import
Do you have some sort of link aggregator that auto-posts to haskell-cafe?
On Sat, May 21, 2011 at 12:09 AM, KC kc1...@gmail.com wrote:
Extension for Pearls of Functional Algorithm Design by Richard Bird,
2010, page 25 #Haskell
-- Extension for Pearls of Functional Algorithm Design by Richard
Bird, 2010, page 25 #Haskell
-- O(log|X|+log|Y|+log|Z|) performance
-- Question: is there a way to get the type signature as the following:
-- smallest :: (Ord a) = Int - [Array Int a] - a
module SelectionProblem where
Do you have a question for the group or something you want to discuss?
On Mon, Apr 25, 2011 at 8:50 PM, cas...@istar.ca wrote:
-- Extension for Pearls of Functional Algorithm Design by Richard Bird,
-- 2010, page 25 #Haskell
-- This version assumes 3 disjoint ordered sets represented as
-- Extension for Pearls of Functional Algorithm Design by Richard Bird,
-- 2010, page 25 #Haskell
-- This version assumes 3 disjoint ordered sets represented as lists.
-- So either: xy XOR xy
-- Since it uses lists it is no faster than the divide and conquer approach.
-- I might try to convert
