Algoritmo de Seleção em Haskell

[crislanio_macedo]

minimo :: Ord a => [a] -> a
minimo [x] = x
minimo (x:xs) = if (filter (<x) xs)== [] then x else minimo xs
remove' a [] = []
remove' a [x] = if a == x then [] else [x]
remove' a (x:xs) = [] ++ if (x == a) then xs else x:(remove' a xs)
-- selectionSort :: Ord a => [a] -> [a]
-- selectionSort :: Ord a => [a] -> [a]
selectionSort [] = []
selectionSort a@(x:xs) = head.minimo a $ selectionSort xs

Como proceder no caso acima, já que a ideia no selectionSort era pegar a cabeça da lista (elemento mínimo), e chamar o resto do da lista sem o elemento mínimo.

Edited March 9, 2015 at 08:50 PM by thoga31
GeSHi

[crislanio_macedo]

selectionSort:: (Ord a) => [a]->[a]
selectionSort [] = []
selectionSort xs = [x] ++ selectionSort (remove' x xs)
where x = minimo xs