FP Laboratory 4/en - Revision history

FuzzyBot: Updating to match new version of source page

2023-10-10T06:24:03Z

Updating to match new version of source page

FuzzyBot: Updating to match new version of source page

2023-10-06T07:52:30Z

Updating to match new version of source page

FuzzyBot: Updating to match new version of source page

2021-10-20T08:52:58Z

Updating to match new version of source page

FuzzyBot: Updating to match new version of source page

2021-10-19T20:16:59Z

Updating to match new version of source page

New page

== Functions working with lists ==
Implement following functions:

* Create a function that takes first n elements of the list.

<syntaxhighlight lang="Haskell">take' :: Int -> [a] -> [a]</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark">
*Main> take' 2 [1,2,3]
[1,2]
</syntaxhighlight>

<div class="mw-collapsible mw-collapsed" data-collapsetext="Hide solution" data-expandtext="Show solution">
<syntaxhighlight lang="Haskell">
take' :: Int -> [a] -> [a]
take' 0 _ = []
take' _ [] = []
take' n (x:xs) = x: take' (n-1) xs
</syntaxhighlight>
[[File:Tryit.png|center|60px|Try it!|link=https://rextester.com/BVU17842]]
</div>
<div style="clear:both"></div>

* Create a function that takes the remaining list after the first n elements.

<syntaxhighlight lang="Haskell">drop' :: Int -> [a] -> [a]</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark">
*Main> drop' 2 [1,2,3]
[3]
</syntaxhighlight>

<div class="mw-collapsible mw-collapsed" data-collapsetext="Hide solution" data-expandtext="Show solution">
<syntaxhighlight lang="Haskell">
drop' :: Int -> [a] -> [a]
drop' 0 x = x
drop' _ [] = []
drop' n (_:xs) = drop' (n-1) xs
</syntaxhighlight>
[[File:Tryit.png|center|60px|Try it!|link=https://rextester.com/BVU17842]]
</div>
<div style="clear:both"></div>

* Create a function that find the smallest element in the list. Consider input restrictions.

<syntaxhighlight lang="Haskell">minimum' :: [a] -> a -- Is this right?</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark">

*Main> minimum' [1,3,4,0]
0
</syntaxhighlight>

<div class="mw-collapsible mw-collapsed" data-collapsetext="Hide solution" data-expandtext="Show solution">
<syntaxhighlight lang="Haskell">
minimum' :: Ord a => [a] -> a
minimum' [x] = x
minimum' (x:y:z) | x < y = minimum' (x:z)
| otherwise = minimum' (y:z)
</syntaxhighlight>
[[File:Tryit.png|center|60px|Try it!|link=https://rextester.com/BVU17842]]
</div>
<div style="clear:both"></div>

* Find all integer divisors of a given number.

<div style="float: right"> [[File:Video logo.png|80px|link=https://youtu.be/8iKGkcOlzpI]]</div>
<syntaxhighlight lang="Haskell">divisors :: Int -> [Int]</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark">
*Main> divisors 32
[1,2,4,8,16,32]
</syntaxhighlight>

<div class="mw-collapsible mw-collapsed" data-collapsetext="Hide solution" data-expandtext="Show solution">
<syntaxhighlight lang="Haskell">
divisors :: Int -> [Int]
divisors n = tmp n where
tmp 0 = []
tmp x | n `mod` x == 0 = x: tmp (x-1)
| otherwise = tmp (x-1)

divisors' :: Int -> [Int]
divisors' n = filter (\x -> n `mod` x == 0) [1..n]

divisors'' :: Int -> [Int]
divisors'' n = [x | x<-[1..n], n `mod` x == 0]
</syntaxhighlight>
[[File:Tryit.png|center|60px|Try it!|link=https://rextester.com/BVU17842]]
</div>
<div style="clear:both"></div>

== Functions working with lists and tuples ==
Implement following functions:
* Create a function that merge two lists into one list of tuples.

<syntaxhighlight lang="Haskell">zipThem:: [a] -> [b] -> [(a,b)]</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark">
*Main> zipThem [1,2,3] "ABCD"
[(1,'A'),(2,'B'),(3,'C')]
</syntaxhighlight>

<div class="mw-collapsible mw-collapsed" data-collapsetext="Hide solution" data-expandtext="Show solution">
<syntaxhighlight lang="Haskell">
zipThem:: [a] -> [b] -> [(a,b)]
zipThem (x:xs) (y:ys) = (x,y) : zipThem xs ys
zipThem _ _ = []
</syntaxhighlight>
[[File:Tryit.png|center|60px|Try it!|link=https://rextester.com/BVU17842]]
</div>
<div style="clear:both"></div>

* Create a function that compute Cartesian product of two vectors.

<syntaxhighlight lang="Haskell">dotProduct :: [a] -> [b] -> [(a,b)]</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark">
*Main> dotProduct [1..4] "ABC"
[(1,'A'),(1,'B'),(1,'C'),(2,'A'),(2,'B'),(2,'C'),(3,'A'),(3,'B'),(3,'C'),(4,'A'),(4,'B'),(4,'C')]
</syntaxhighlight>

<div class="mw-collapsible mw-collapsed" data-collapsetext="Hide solution" data-expandtext="Show solution">
<syntaxhighlight lang="Haskell">
dotProduct :: [a] -> [b] -> [(a,b)]
dotProduct [] _ = []
dotProduct (x:xs) ys = tmp ys ++ dotProduct xs ys where
tmp [] = []
tmp (b:bs) = (x,b) : tmp bs

dotProduct' :: [a] -> [b] -> [(a,b)]
dotProduct' xs ys = [(x,y)|x<-xs, y<-ys]

dotProduct'' :: [a] -> [b] -> [(a,b)]
dotProduct'' x y =
zip (concat (map (replicate (length y)) x))
(concat (replicate (length x) y))
</syntaxhighlight>
[[File:Tryit.png|center|60px|Try it!|link=https://rextester.com/BVU17842]]
</div>
<div style="clear:both"></div>

* Create a function that computes n-th number in the Fibonacci sequence. The function should use tuples in the solution.

<div style="float: right"> [[File:Video logo.png|80px|link=https://youtu.be/Sge0DXXI36k]]</div>
<syntaxhighlight lang="Haskell">fibonacci :: Int -> Int</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark">
*Main> fibonacci 12
144
</syntaxhighlight>

<div class="mw-collapsible mw-collapsed" data-collapsetext="Hide solution" data-expandtext="Show solution">
<syntaxhighlight lang="Haskell">
fibonacci :: Int -> Int
fibonacci n = fst (tmp n) where
fibStep (a,b) = (b,a+b)
tmp 0 = (0,1)
tmp x = fibStep (tmp (x-1))
</syntaxhighlight>
[[File:Tryit.png|center|60px|Try it!|link=https://rextester.com/BVU17842]]
</div>
<div style="clear:both"></div>

== High-order functions ==
* Create a function that takes a string and converts all characters to upper case letters.

<syntaxhighlight lang="Haskell">allToUpper :: String -> String</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark">
*Main> allToUpper "aAbc"
"AABC"
</syntaxhighlight>

<div class="mw-collapsible mw-collapsed" data-collapsetext="Hide solution" data-expandtext="Show solution">
<syntaxhighlight lang="Haskell">
import Data.Char

allToUpper :: String -> String
allToUpper xs = [toUpper x |x<-xs]

allToUpper' :: String -> String
allToUpper' xs = map toUpper xs
</syntaxhighlight>
[[File:Tryit.png|center|60px|Try it!|link=https://rextester.com/BVU17842]]
</div>
<div style="clear:both"></div>

* Implement the [https://en.wikipedia.org/wiki/Quicksort <code>quicksort</code>] algorithm. As a pivot use always the first element in the list. For dividing the list, use the function

<code>filter</code>. <div style="float: right"> [[File:Video logo.png|80px|link=https://youtu.be/Sj8cbRv89To]]</div>
<syntaxhighlight lang="Haskell">quicksort :: (Ord a) => [a] -> [a]</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark">
*Main> filter (<5) [1..10]
[1,2,3,4]
</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark">
*Main> quicksort [1,5,3,7,9,5,2,1]
[1,1,2,3,5,5,7,9]
</syntaxhighlight>

<div class="mw-collapsible mw-collapsed" data-collapsetext="Hide solution" data-expandtext="Show solution">
<syntaxhighlight lang="Haskell">
quicksort :: (Ord a) => [a] -> [a]
quicksort [] = []
quicksort (x:xs) = let lp = filter (< x) xs
rp = filter (>= x) xs
in quicksort lp ++ [x] ++ quicksort rp
</syntaxhighlight>
[[File:Tryit.png|center|60px|Try it!|link=https://rextester.com/BVU17842]]
</div>
<div style="clear:both"></div>

@@ Line 207: / Line 207: @@
 * Create a function that removes the first occurrence of a given element from a list.
-<syntaxhighlight lang="Haskell">removeOne :: Eq a => [a] -> [a]</syntaxhighlight>
+<syntaxhighlight lang="Haskell">removeOne :: Eq a => a -> [a] -> [a]</syntaxhighlight>
 <syntaxhighlight lang="Haskell" class="myDark">
 *Main> removeOne 4 [1,4,6,8,4,5,4,7]
@@ Line 217: / Line 217: @@
 * Create a function that removes all occurrences of a given element from a list.
-<syntaxhighlight lang="Haskell">removeAll :: Eq a => [a] -> [a]</syntaxhighlight>
+<syntaxhighlight lang="Haskell">removeAll :: Eq a => a -> [a] -> [a]</syntaxhighlight>
 <syntaxhighlight lang="Haskell" class="myDark">
 *Main> removeAll 4 [1,4,6,8,4,5,4,7]
@@ Line 279: / Line 279: @@
 * Create a function that splits a list of numbers into a list of triples. Extra elements should be forgotten.
-<syntaxhighlight lang="Haskell">makeTriples :: [Int] -> [(Int,Int,Int)]</syntaxhighlight>
+<syntaxhighlight lang="Haskell">makeTriples :: [a] -> [(a,a,a)]</syntaxhighlight>
 <syntaxhighlight lang="Haskell" class="myDark">
 *Main> makeTriples [1,2,3,4,5,6,7,8,9]

← Older revision		Revision as of 07:52, 6 October 2023
Line 203:		Line 203:
	</div>		</div>
	<div style="clear:both"></div>		<div style="clear:both"></div>
		+
		+	=Additional exercises=
		+	* Create a function that removes the first occurrence of a given element from a list.
		+
		+	<syntaxhighlight lang="Haskell">removeOne :: Eq a => [a] -> [a]</syntaxhighlight>
		+	<syntaxhighlight lang="Haskell" class="myDark">
		+	*Main> removeOne 4 [1,4,6,8,4,5,4,7]
		+	[1,6,8,4,5,4,7]
		+	*Main> removeOne 'e' "Ahoj"
		+	"Ahoj"
		+	</syntaxhighlight>
		+
		+	* Create a function that removes all occurrences of a given element from a list.
		+
		+	<syntaxhighlight lang="Haskell">removeAll :: Eq a => [a] -> [a]</syntaxhighlight>
		+	<syntaxhighlight lang="Haskell" class="myDark">
		+	*Main> removeAll 4 [1,4,6,8,4,5,4,7]
		+	[1,6,8,5,7]
		+	*Main> removeAll 'e' "Ahoj"
		+	"Ahoj"
		+	</syntaxhighlight>
		+
		+	* Create your own implementation of the [http://zvon.org/other/haskell/Outputprelude/replicate_f.html <code>replicate</code>] function.
		+
		+	<syntaxhighlight lang="Haskell">replicate' :: Int -> a -> [a]</syntaxhighlight>
		+	<syntaxhighlight lang="Haskell" class="myDark">
		+	*Main> replicate' 4 8
		+	[8,8,8,8]
		+	</syntaxhighlight>
		+
		+	* Create a function that realizes the left rotation of a list by n elements. Function [http://zvon.org/other/haskell/Outputprelude/iterate_f.html <code>iterate</code>] might be helpful.
		+
		+	<syntaxhighlight lang="Haskell">rotateLeftN :: [a] -> Int -> [a]</syntaxhighlight>
		+	<syntaxhighlight lang="Haskell" class="myDark">
		+	*Main> rotateLeftN [1,2,3,4,5] 2
		+	[3,4,5,1,2]
		+	*Main> rotateLeftN [1,2,3,4,5] 6
		+	[2,3,4,5,1]
		+	</syntaxhighlight>
		+
		+	* Create a function that realizes the right rotation of a list by n elements.
		+
		+	<syntaxhighlight lang="Haskell">rotateRightN :: [a] -> Int -> [a]</syntaxhighlight>
		+	<syntaxhighlight lang="Haskell" class="myDark">
		+	*Main> rotateRightN [1,2,3,4,5] 2
		+	[4,5,1,2,3]
		+	*Main> rotateRightN [1,2,3,4,5] 6
		+	[5,1,2,3,4]
		+	</syntaxhighlight>
		+
		+	* Create function alternate, which interleaves two lists into one, alternating between elements taken from the first list and elements from the second.
		+
		+	<syntaxhighlight lang="Haskell">alternate :: [a] -> [a] -> [a]</syntaxhighlight>
		+	<syntaxhighlight lang="Haskell" class="myDark">
		+	*Main> alternate [1,2,3] [4,5,6]
		+	[1,4,2,5,3,6]
		+	*Main> alternate [1,2] [4,5,6]
		+	[1,4,2,5,6]
		+	*Main> alternate [1,2,3] [4]
		+	[1,4,2,3]
		+	*Main> alternate [1,2,3] []
		+	[1,2,3]
		+	</syntaxhighlight>
		+
		+	* Use filter to create a non-recursive function that takes a list of integers as input and returns a list of those that are even and greater than 7.
		+
		+	<syntaxhighlight lang="Haskell">filterEvenGt7 :: [Int] -> [Int]</syntaxhighlight>
		+	<syntaxhighlight lang="Haskell" class="myDark">
		+	*Main> filterEvenGt7 [1,2,6,9,10,3,12,8]
		+	[10,12,8]
		+	*Main> filterEvenGt7 [5,2,6,19,129]
		+	[]
		+	</syntaxhighlight>
		+
		+	* Create a function that splits a list of numbers into a list of triples. Extra elements should be forgotten.
		+
		+	<syntaxhighlight lang="Haskell">makeTriples :: [Int] -> [(Int,Int,Int)]</syntaxhighlight>
		+	<syntaxhighlight lang="Haskell" class="myDark">
		+	*Main> makeTriples [1,2,3,4,5,6,7,8,9]
		+	[(1,2,3),(4,5,6),(7,8,9)]
		+	*Main> makeTriples [1,2,3,4,5,6,7,8,9,10,11]
		+	[(1,2,3),(4,5,6),(7,8,9)]
		+	</syntaxhighlight>
		+
		+
		+	* Create a function that inserts an element into a list on the specific index.
		+
		+	<syntaxhighlight lang="Haskell">insertOnIndex :: [a] -> a -> Int -> [a]</syntaxhighlight>
		+	<syntaxhighlight lang="Haskell" class="myDark">
		+	*Main> insertOnIndex [4,5,6,7,8,9,10] 100 0
		+	[100,4,5,6,7,8,9,10]
		+	*Main> insertOnIndex [4,5,6,7,8,9,10] 100 3
		+	[4,5,6,100,7,8,9,10]
		+	*Main> insertOnIndex [4,5,6,7,8,9,10] 100 6
		+	[4,5,6,7,8,9,100,10]
		+	</syntaxhighlight>
		+
		+	* Create a function that joins the list of lists into one list using a separator.
		+
		+	<syntaxhighlight lang="Haskell">join :: [[a]] -> a -> [a]</syntaxhighlight>
		+	<syntaxhighlight lang="Haskell" class="myDark">
		+	*Main> join ["I","love","functional","programming"] ' '
		+	"I love functional programming"
		+	*Main> join [[1,2,3],[4,5],[6,7,8],[9]] 0
		+	[1,2,3,0,4,5,0,6,7,8,0,9]
		+	</syntaxhighlight>

@@ Line 179: / Line 179: @@
 <div style="clear:both"></div>
-* Implement the [https://en.wikipedia.org/wiki/Quicksort <code>quicksort</code>] algorithm. As a pivot use always the first element in the list. For dividing the list, use the function
+* Implement the [https://en.wikipedia.org/wiki/Quicksort <code>quicksort</code>] algorithm. As a pivot use always the first element in the list. For dividing the list, use the function <code>filter</code>.
-<code>filter</code>. <div style="float: right"> [[File:Video logo.png|80px|link=https://youtu.be/Sj8cbRv89To]]</div>
+<div style="float: right"> [[File:Video logo.png|80px|link=https://youtu.be/Sj8cbRv89To]]</div>
 <syntaxhighlight lang="Haskell">quicksort :: (Ord a) => [a] -> [a]</syntaxhighlight>
 <syntaxhighlight lang="Haskell" class="myDark">