ksort.hs

--sorting algorithm inspired from quick sort in haskel 
ksort  :: [Int]->[Int]
ksort  [] = []
ksort  (k:a)  = ksort [i|i<-a,i<=k]++(k:(ksort [i|i<-a,i>k]) )
main = do
        input <- getLine
        let output::[Int]
            output = read input
        putStrLn (show (ksort output ))