Algorithms.DivideAndConquer

Documentation

divideAndConquer :: Monoid s => (a -> s) -> [a] -> s

Divide and conquer for

divideAndConquer1 :: Semigroup s => (a -> s) -> NonEmpty a -> s

Divide and conquer strategy

the running time is: O(n*L) + T(n) = 2T(n/2) + M(n)

where M(n) is the time corresponding to the semigroup operation of s

divideAndConquer1With :: (s -> s -> s) -> (a -> s) -> NonEmpty a -> s

Divide and conquer strategy

the running time is: O(n*L) + T(n) = 2T(n/2) + M(n)

where M(n) is the time corresponding to the merge operation s

mergeSorted :: Ord a => NonEmpty a -> NonEmpty a -> NonEmpty a

mergeSortedLists :: Ord a => [a] -> [a] -> [a]

mergeSortedBy :: (a -> a -> Ordering) -> NonEmpty a -> NonEmpty a -> NonEmpty a

Given an ordering and two nonempty sequences ordered according to that ordering, merge them

mergeSortedListsBy :: (a -> a -> Ordering) -> [a] -> [a] -> [a]

Given an ordering and two nonempty sequences ordered according to that ordering, merge them