{-# LANGUAGE PatternSignatures #-}
import Algorithms.ExternalSort
import Data.List
-- fast 

-- this will take a while but should eventurally return the right answer
main  = do
  (res :: Int) <- return . last =<< externalSort bigList
  putStrLn . show $ res


-- pure, in-memory prelude sort will crash your computer
mainBadIdea  = putStrLn . show $ last $ sort bigList


bigList :: [Int]
bigList = reverse [1..10^8]