A Collection of Code Snippets in as Many Programming Languages as Possible
This project is maintained by TheRenegadeCoder
Welcome to the Bubble Sort in Haskell page! Here, you'll find the source code for this program as well as a description of how the program works.
module Main where import Text.Read import System.Environment import System.Exit (exitWith, ExitCode(ExitFailure)) import Data.List (intercalate) bubble :: Ord a => [a] -> [a] bubble xs = foldl (\acc _ -> pass acc) xs xs where pass [x] = [x] pass (x1:x2:xs) | x1 > x2 = x2:(pass (x1:xs)) | otherwise = x1:(pass (x2:xs)) headMaybe :: [a] -> Maybe a headMaybe  = Nothing headMaybe (x:xs) = Just x -- Converts string in format "1, 2, 3" to a Maybe list of int stringToListMaybe :: String -> Maybe [Int] stringToListMaybe str = readMaybe $ "[" ++ str ++ "]" :: Maybe [Int] -- Ensure that a list contains at least two elements verifyListLength :: Ord a => [a] -> Maybe [a] verifyListLength  = Nothing verifyListLength [x] = Nothing verifyListLength (x:xs) = Just (x:xs) listToString :: [Int] -> String listToString = intercalate ", " . map show main :: IO () main = do args <- getArgs let xs = headMaybe args >>= stringToListMaybe >>= verifyListLength case xs of Nothing -> do putStrLn "Usage: please provide a list of at least two integers to sort in the format \"1, 2, 3, 4, 5\"" exitWith $ ExitFailure 1 Just xs -> putStrLn $ listToString $ bubble xs
Bubble Sort in Haskell was written by:
If you see anything you'd like to change or update, please consider contributing.
Note: The solution shown above is the current solution in the Sample Programs repository as of Mar 26 2019 01:28:05. The solution was first committed on Dec 02 2018 01:24:40. As a result, documentation below may be outdated.
No 'How to Implement the Solution' section available. Please consider contributing.
No 'How to Run the Solution' section available. Please consider contributing.