Programmier-Aufgabe (partition)

Typ:

partition :: (a -> Bool) -> [a] -> ([a],[a])
Beispiel:
partition odd [3,1,4,1,5,9,2,6,5,3,5,8,9,7,9]
==> ([3,1,1,5,9,5,3,5,9,7,9],[4,2,6,8])
Ansatz:
partition p [] = ( undefined , undefined )
partition p (x : xs) =
    let ( yeah, noh ) = partition p xs
    in  if undefined
        then ( undefined  ,  undefined )
        else undefined



Johannes Waldmann 2006-06-22