How does laziness affect benchmarking in Haskell?

Published: 4/10/2017
How does laziness affect benchmarking in Haskell?
Source: STACKOVERFLOW.COM

This question is related to the following question : How to force evaluation in Haskell? I want to benchmark the algorithm quicksort for a list. For this I have made a certain number of files which have random numbers in them. Here is the relevant part of the code in question : import System.IO import Data.Time import Control.DeepSeq getListFromFiles :: IO [[Int]] quicksort :: (Ord a) => [a] -&

Read more
Related news
Comment