Can you point out any misleading information in their advertisements? By the way, it is a full blown OS.
Or perhaps like this if you do not want to use `reverse` and want it to be tail recursive: collatz :: Int -> [Int] collatz x = go id x [] where go :: ([Int] -> [Int]) -> Int -> [Int] -> [Int] go f 1 = f . (1:) go f n =…
Can you point out any misleading information in their advertisements? By the way, it is a full blown OS.
Or perhaps like this if you do not want to use `reverse` and want it to be tail recursive: collatz :: Int -> [Int] collatz x = go id x [] where go :: ([Int] -> [Int]) -> Int -> [Int] -> [Int] go f 1 = f . (1:) go f n =…