Rakarake/churf
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Fix quicksort example

Browse source
This commit is contained in:
Martin Fredin 2023-05-15 00:27:48 +02:00
parent 2d41dac6eb
commit e1bb5760e0
1 changed files with 5 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

7
sample-programs/Quicksort.crf → sample-programs/working/quicksort.crf
View file

@ -16,13 +16,15 @@ toChar x = case x of
8 => '8' 8 => '8'
9 => '9' 9 => '9'
filter : (a -> Bool) -> List a -> List a
filter p xs = case xs of filter p xs = case xs of
Nil => Nil Nil => Nil
Cons x xs => case p x of Cons x xs => case p x of
True => Cons x (filter p xs) True => Cons x (filter p xs)
False => filter p xs False => filter p xs
(++) as bs = case as of .++ : List a -> List a -> List a
.++ as bs = case as of
Nil => bs Nil => bs
Cons x xs => Cons x (xs ++ bs) Cons x xs => Cons x (xs ++ bs)
@ -38,4 +40,5 @@ descList from to = case to < from of
False => Cons to (descList from (to - 1)) False => Cons to (descList from (to - 1))
True => Nil True => Nil
-- main = let list = (5 :: (2 :: (8 :: (9 :: (6 :: (0 :: (1 :: Nil))))))) in printStr (toStr (quicksort list)) main = let list = Cons 5 (Cons 2 (Cons 8 (Cons 9 (Cons 6 (Cons 0 (Cons 1 Nil)))))) in
printStr (toStr (quicksort list))