Difference between revisions of "FP Homework 4"
Jump to navigation
Jump to search
(Created page with "== Arrays and vectors in Haskell== == 1 - Bubble sort == * Create a function, that sorts an array using quicksort algorithm. <syntaxhighlight lang="Haskell">quickSort :: Ar...") |
|||
| Line 1: | Line 1: | ||
== Arrays and vectors in Haskell== | == Arrays and vectors in Haskell== | ||
| − | == 1 - | + | == 1 - Quicksort == |
| − | * Create a function, that sorts an array using quicksort algorithm. | + | * Create a function, that sorts an array using quicksort algorithm [https://en.wikipedia.org/wiki/Quicksort <code>quicksort</code>]. Inside, you must use the mutable array <code>STArray</code>. |
<syntaxhighlight lang="Haskell">quickSort :: Array Int Int -> Array Int Int</syntaxhighlight> | <syntaxhighlight lang="Haskell">quickSort :: Array Int Int -> Array Int Int</syntaxhighlight> | ||
<syntaxhighlight lang="Haskell" class="myDark"> | <syntaxhighlight lang="Haskell" class="myDark"> | ||
Revision as of 13:15, 4 November 2022
Arrays and vectors in Haskell
1 - Quicksort
- Create a function, that sorts an array using quicksort algorithm
quicksort. Inside, you must use the mutable arraySTArray.
quickSort :: Array Int Int -> Array Int Int
ghci> elems $ quickSort $ listArray (0,5) [8,4,9,6,7,1]
[1,4,6,7,8,9]
