@@ -11,7 +11,7 @@ qsort inp with (filtered (<) inp)
11testList : Int -> Int -> List Int -> List Int
11testList : Int -> Int -> List Int -> List Int
12testList 0 seed acc = acc
12testList 0 seed acc = acc
13-- Need to explicitly mod since different back ends overflow differently
13-- Need to explicitly mod since different back ends overflow differently
14−testList x seed acc = let seed' = seed * 12345 + 768 `mod` 65536 in
14+testList x seed acc = let seed' = (seed * 12345 + 768) `mod` 65536 in
15 testList (x - 1) seed'
15 testList (x - 1) seed'
16 ((seed' `mod` 100) :: acc)
16 ((seed' `mod` 100) :: acc)