Haskell - 05.12.13

map2 :: (a -> b) -> [a] -> [b]
map2 f xs = [f x | x<-xs]

myFunc (x:xs) = foldr (+) x xs

-- savarjishoebi:
-- 1)
myAverage xs = foldr (+) 0 xs / myLength xs
myLength [] = 0
myLength (x:xs) = myLength xs + 1

-- 2)
mySkalar xs ys = foldr (+)  0 (zipWith (*) xs ys)

-- 3)
countEven xs = foldr (+) 0 [ x | x<-xs, even x ]

--4)
quicksort             ::    Ord a => [a] -> [a]
quicksort []        =   []
quicksort (p:xs) =  (quicksort lesser) ++ [p] ++ (quicksort greater)
            where
                    lesser  = filter (< p) xs
                    greater = filter (>= p) xs

--5)
quicksort2 p (xs) = [x | x<-quicksort xs, p x]