Bubblesort.hs

module Data.Tensort.Subalgorithms.Bubblesort (bubblesort) where

import Data.Tensort.Utils.ComparisonFunctions (lessThanInt, lessThanRecord)
import Data.Tensort.Utils.Types (Record, Sortable (..))

bubblesort :: Sortable -> Sortable
bubblesort (SortInt ints) = SortInt (foldr acc [] ints)
  where
    acc :: Int -> [Int] -> [Int]
    acc x xs = bubblesortSinglePass x xs lessThanInt
bubblesort (SortRec recs) = SortRec (foldr acc [] recs)
  where
    acc :: Record -> [Record] -> [Record]
    acc x xs = bubblesortSinglePass x xs lessThanRecord

bubblesortSinglePass :: a -> [a] -> (a -> a -> Bool) -> [a]
bubblesortSinglePass x [] _ = [x]
bubblesortSinglePass x (y : remaningElements) lessThan = do
  if lessThan x y
    then x : bubblesortSinglePass y remaningElements lessThan
    else y : bubblesortSinglePass x remaningElements lessThan