Program in Haskell (Replace the question marks with code). Has to be recursive: my_map :: (a -> b) -> [a] -> [b] my_map = ? my_all :: (a -> Bool) -> [a] -> Bool my_all = ? my_any :: (a -> Bool) -> [a] -> Bool my_any = ? my_filter :: (a -> Bool) -> [a] -> [a] my_filter = ? my_dropWhile :: (a -> Bool) -> [a] -> [a] my_dropWhile = ? my_takeWhile :: (a -> Bool) -> [a] -> [a] my_takeWhile = ? my_break :: (a -> Bool) -> [a] -> ([a], [a]) my_break = ? -- Implement the Prelude functions and, or, concat using foldr my_and :: [Bool] -> Bool my_and = ? my_or :: [Bool] -> Bool my_or = ? my_concat :: [[a]] -> [a] my_concat = ? -- Implement the functions sum, product, reverse using foldl my_sum :: Num a => [a] -> a my_sum = ? my_product :: Num a => [a] -> a my_product = ? my_reverse :: [a] -> [a] my_reverse = ?
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Program in Haskell (Replace the question marks with code). Has to be recursive:
my_map :: (a -> b) -> [a] -> [b]
my_map = ?
my_all :: (a -> Bool) -> [a] -> Bool
my_all = ?
my_any :: (a -> Bool) -> [a] -> Bool
my_any = ?
my_filter :: (a -> Bool) -> [a] -> [a]
my_filter = ?
my_dropWhile :: (a -> Bool) -> [a] -> [a]
my_dropWhile = ?
my_takeWhile :: (a -> Bool) -> [a] -> [a]
my_takeWhile = ?
my_break :: (a -> Bool) -> [a] -> ([a], [a])
my_break = ?
-- Implement the Prelude functions and, or, concat using foldr
my_and :: [Bool] -> Bool
my_and = ?
my_or :: [Bool] -> Bool
my_or = ?
my_concat :: [[a]] -> [a]
my_concat = ?
-- Implement the functions sum, product, reverse using foldl
my_sum :: Num a => [a] -> a
my_sum = ?
my_product :: Num a => [a] -> a
my_product = ?
my_reverse :: [a] -> [a]
my_reverse = ?
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
