2013年10月16日水曜日

開発環境

『初めてのプログラミング 第2版』(Chris Pine 著、長尾 高弘 訳、オライリー・ジャパン、2010年、ISBN978-4-87311-469-9)の10章(章全部で復習), 10.3(練習問題)、辞書順ソートをHaskellで解いてみる。

その他参考書籍

辞書順ソート(小文字化(Data.CharモジュールのtoLower関数))

コード(BBEdit)

sample.hs

{-# OPTIONS -Wall -Werror #-}

import qualified Data.Char as Char

main :: IO ()
main = do
    let langs :: [String]
        langs = ["ruby", "python", "dart", "haskell", "c", 
                 "scheme", "lisp", "csharp", "cpp", "perl",
                 "Ruby", "Python", "Dart", "Haskell", "C",
                 "Scheme", "Lisp", "CSharp", "CPP", "Perl"]
        sorted_langs = sort langs
    putStrLn $ "ソート前: " ++ (show $ langs)
    putStrLn $ "ソート後: " ++ (show $ sorted_langs)


sort :: [String] -> [String]
sort [] = []
sort xs =
    let myMinString :: [String] -> String
        myMinString [] = []
        myMinString (y:[]) = y
        myMinString (y:z:ys) = if myMin y z
                               then myMinString (y:ys)
                               else myMinString (z:ys)
        myMin :: String -> String -> Bool
        myMin [] _ = True
        myMin _ [] = False
        myMin (u:us) (t:ts)
            | (Char.toLower u) < (Char.toLower t) = True
            | (Char.toLower u) > (Char.toLower t) = False
            | otherwise = myMin us ts
        remove :: [String] -> String -> [String]
        remove (v:vs) w = if v == w
                          then vs
                          else v:remove vs w
        remove _ _ = []
        
        a = myMinString xs
    in a:(sort $ remove xs a)

入出力結果(Terminal, runghc)

$ runghc sample.hs
ソート前: ["ruby","python","dart","haskell","c","scheme","lisp","csharp","cpp","perl","Ruby","Python","Dart","Haskell","C","Scheme","Lisp","CSharp","CPP","Perl"]
ソート後: ["c","C","cpp","CPP","csharp","CSharp","dart","Dart","haskell","Haskell","lisp","Lisp","perl","Perl","python","Python","ruby","Ruby","scheme","Scheme"]
$

0 コメント:

コメントを投稿