Search Results

The following function finds all local maxima. A local maxima is an element of a list such that it's greater than either of its neighbor elements. An element with 1 neighbor is not a local maximum. …

Yorgey's 2013 Haskell course, I'm working on a homework to simulate a Risk battle. …

Learn You a Haskell gives an exercise to implement the following function: -- make a function that simulates tossing a function 3 times import System.Random tossCoin3 :: Int -> (Bool, Bool, Bool) tossCoin3 …

I've implemented the following nub' or "give distinct elements of list" function: nub' :: (Eq a) => [a] -> [a] nub' [] = [] nub' xs = nubHelper xs [] nubHelper :: (Eq a) => [a] -> [a] -> [a] nubHelp …

I'm implementing transpose in Haskell. -- transpose [[1,2,3],[4,5,6],[7,8,9]] -- [[1,4,7],[2,5,8],[3,6,9]] Please give it a look. … [] head' (x:xs) = [x] tail' :: [a] -> [a] tail' [] = [] tail' (x:xs) = xs flatten' :: [[a]] -> [a] flatten' as = foldl (\acc x -> acc ++ x) [] as Side note - I know that I could look at the Haskell …

I wrote a function that inserts or updates a Map key value depending on whether the key is already in the map. If it is, then the value gets added to the already existing map's value. import Data.Map …

Learn You a Haskell explains the unwords function. $unwords ["hey","there","mate"] "hey there mate" Here's my implementation. …

I implemented the split function in Haskell: split :: (Eq a) => a -> [a] -> [[a]] split _ [] = [] split x ys = f : split x rest where (f, rest) = break (== x) (dropWhile (== x) ys) Note that I'm …

Please review my implementation of Fermat's Factorization. fermat :: Int -> Maybe (Int, Int) fermat n = odd' n >> (go $ ceiling $ sqrt (fromIntegral n)) where go a = case (try n a) of j @ (Just _ …

I implemented the Fibonacci sequence using iterate. import Data.List fib :: Int -> Maybe Int fib n | n < 0 = Nothing | otherwise = (fmap (snd . fst)) $ find (\(_,i) -> n == i) (zip res [0..]) …

This function checks if a list is sorted. isSorted' :: (Ord a) => [a] -> [a] -> a -> Bool isSorted' [] [] _ = True isSorted' (x:xs) [] _ = isSorted' xs xs (head xs) isSorted' orig (x:xs) a | a > x …

Working through Learn You a Haskell, I made a Reverse Polish Notation calculator. …

Originally I posted this incorrect attempt - Searching a Join List for an index. Given a JoinList: data JoinList m a = Empty | Single m a | Append m (JoinList m a …

Learn You a Haskell shows the intersperse function: ghci> intersperse '.' …

I implemented the group function: group' :: (Ord a) => [a] -> [[a]] group' [] = [] group' xs = takeWhile (== head' xs) (sorted xs) : (group' $ dropWhile (== head' xs) (sor …