Foldl

December 31, 2019

product_td :: Num a => [a] -> a
product_td = _product 1
         where
             _product v [] = v
             _product v (x:xs) = _product (v * x) xs

Note: The base case _product v [] = v returns v, which is the result of the recursed function calls.

product_td :: Num a => [a] -> a
product_td = foldl (*) 1

merge :: Ord a => [a] -> [a] -> [a] merge (xs) [] = xs merge [] (ys) = ys merge (x:xs) (y:ys) | x < y = x : merge xs (y:ys) | otherwise = y : merge (x:xs) ys halve :: [a] -> ([a], [a]) halve xs = (take (length xs `div` 2) xs, drop (length xs `div` 2) xs) msort :: Ord a => [a] -> [a] msort [] = [] msort [x] = [x] msort xs = merge (msort y) (msort z) where y, z = halve xs ...

Else statements and early returns

January 3, 2020

The early return statement is useful. Indicating that there is no more processing increases readability significantly. I think that the most readable approach is to have early return statements and else statements. The else statement highlights to the reader the alternative flow paths. The early return statements highlights to the reader the flow end. This dual approach's greater readability outweighs the minor increase in duplication. ...

Foldl

Merge sort

Else statements and early returns