Untitled

Anonymous
haskell
03/03/2023 8:05 AM
256 B
25
Indexable
alternateSort :: [Int] -> [Int]
alternateSort l =
 if isEmpty l then l
 else konso (maxElmt l) (konso (minElmt l) (alternateSort (delOneElement (maxElmt l) (delOneElement (minElmt l) l))))
Editor is loading...