Difference between revisions of "FP Homework 4"

Latest revision as of 13:16, 4 November 2022

Create a function, that sorts an array using quicksort algorithm quicksort. Inside, you must use the mutable array STArray.

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]

@@ Line 2: / Line 2: @@
 == 1 - Quicksort ==
-* 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>.
+* 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 [https://hackage.haskell.org/package/array-0.5.4.0/docs/Data-Array-ST.html#t:STArray <code>STArray</code>].
 <syntaxhighlight lang="Haskell">quickSort :: Array Int Int -> Array Int Int</syntaxhighlight>
 <syntaxhighlight lang="Haskell" class="myDark">