Ein Klassiker der Sortieralgorithmen:

`

bubble :: Ord a => [a] -> [a]
bubble [] = []
bubble [x] = [x]
bubble (x:y:xs)
	| (x  [a] -> [a]
bubblesort [] = []
bubblesort [x] = [x]
bubblesort xs = bubblesort (init y) ++ [last y]
	where y = bubble xs

`

Informationen zu Laufzeit und Effizienz reiche ich nach.