Beh01 at 12:53, 4 November 2022

2022-11-04T12:53:16Z

Beh01: Created page with "== Arrays == == Bubble sort == * Create a function, that sorts an array using the bubble sort algorithm. bubbleSort :: Array Int Int -> Arra..."

2022-11-04T12:52:07Z

Created page with "== Arrays == == Bubble sort == * Create a function, that sorts an array using the bubble sort algorithm. <syntaxhighlight lang="Haskell">bubbleSort :: Array Int Int -> Arra..."

New page

== Arrays ==

== Bubble sort ==
* Create a function, that sorts an array using the bubble sort algorithm.
<syntaxhighlight lang="Haskell">bubbleSort :: Array Int Int -> Array Int Int</syntaxhighlight>
<syntaxhighlight lang="Haskell" class="myDark">
ghci> elems $ bubbleSort $ listArray (0,5) [8,4,9,6,7,1]
[1,4,6,7,8,9]
</syntaxhighlight>

<div class="mw-collapsible mw-collapsed" data-collapsetext="Hide solution" data-expandtext="Show solution">
<syntaxhighlight lang="Haskell">
module Main (main) where
import System.Random
import System.Environment

myCycle :: Integer -> Integer -> IO Integer
myCycle i c
| i == 0 = return c
| otherwise = do
x <- randomRIO (0, 1.0) :: IO Double
y <- randomRIO (0, 1.0) :: IO Double
myCycle (i-1) (if sqrt (x*x + y*y) <= 1 then c+1 else c)

main :: IO ()
main = do
[arg] <- getArgs
let number = read arg::Integer
inside <- myCycle number 0
let my_pi = (fromIntegral (4*inside) / fromIntegral number) :: Double
print my_pi
</syntaxhighlight>
</div>
<div style="clear:both"></div>

@@ Line 11: / Line 11: @@
 <div class="mw-collapsible mw-collapsed" data-collapsetext="Hide solution" data-expandtext="Show solution">
 <syntaxhighlight lang="Haskell">
-module Main (main) where
+import Data.Array
-import System.Random
+import Data.Array.ST
-import System.Environment
+import Control.Monad
-myCycle :: Integer -> Integer -> IO Integer
+bubbleSort :: Array Int Int -> Array Int Int
-myCycle i c
+bubbleSort myArray = runSTArray  $ do
-  | i == 0 = return c
+     stArray <- thaw myArray
-  | otherwise = do
+    let end = (snd . bounds) myArray
-     x <- randomRIO (0, 1.0) :: IO Double
+     forM_ [1 .. end] $ \i -> do
-     y <- randomRIO (0, 1.0) :: IO Double
+        forM_ [0 .. (end - i)] $ \j -> do
-    myCycle (i-1) (if sqrt (x*x + y*y) <= 1 then c+1 else c)
+            val <- readArray stArray j
+            nextVal <- readArray stArray (j + 1)
-main :: IO ()
+            let outOfOrder = val > nextVal
-main = do
+            when outOfOrder $ do
-    [arg] <- getArgs
+                writeArray stArray j nextVal
-    let number = read arg::Integer
+                writeArray stArray (j + 1) val
-    inside <- myCycle number 0
+     return stArray
 </syntaxhighlight>
 </div>
 <div style="clear:both"></div>

PFP Laboratory 9 - Revision history

Beh01 at 12:53, 4 November 2022

Beh01: Created page with "== Arrays == == Bubble sort == * Create a function, that sorts an array using the bubble sort algorithm. bubbleSort :: Array Int Int -> Arra..."