Difference between revisions of "FP Laboratory 4"
Jump to navigation
Jump to search
| Line 18: | Line 18: | ||
* Create a function that compute Cartesian product of two vectors. | * Create a function that compute Cartesian product of two vectors. | ||
<syntaxhighlight lang="Haskell">dotProduct :: [a] -> [b] -> [(a,b)]</syntaxhighlight> | <syntaxhighlight lang="Haskell">dotProduct :: [a] -> [b] -> [(a,b)]</syntaxhighlight> | ||
| + | * Create a function that computes n-th number in the Fibonacci sequence. The function should be use n bigger then 50 and get the result in less then a second). | ||
| + | <syntaxhighlight lang="Haskell">fibonacci :: Int -> Int</syntaxhighlight> | ||
Revision as of 11:15, 17 September 2019
Functions working with lists
Implement following functions:
- Create a function that takes first n elements of the list.
take :: a -> [a] -> [a]
- Create a function that takes the remaining list after the first n elements.
drop :: a -> [a] -> a
- Create a function that find the smallest element in the list. Consider input restrictions.
minimum :: [a] -> a -- Is this right?
- Find all prime divisors of a given number.
divisors :: a -> [a]
Functions working with lists and tuples
Implement following functions:
- Create a function that merge two lists into one list of tuples.
zipThem:: [a] -> [b] -> [(a,b)]
- Create a function that compute Cartesian product of two vectors.
dotProduct :: [a] -> [b] -> [(a,b)]
- Create a function that computes n-th number in the Fibonacci sequence. The function should be use n bigger then 50 and get the result in less then a second).
fibonacci :: Int -> Int
