Performance Haskell/GHC使用“过滤器”/“列表理解”对原始排序的性能
使用Performance Haskell/GHC使用“过滤器”/“列表理解”对原始排序的性能,performance,sorting,haskell,functional-programming,list-comprehension,Performance,Sorting,Haskell,Functional Programming,List Comprehension,使用-O3编译，使用 quicksort [] = [] quicksort (x : xs) = quicksort (filter (< x) xs) ++ [x] ++ quicksort (filter (>= x) xs) quicksort2 [] = [] quicksort2 (x : xs) = quicksort2 [y | y <- xs, y &
-O3quicksort [] = []
quicksort (x : xs) = quicksort (filter (< x) xs)
++ [x] ++
quicksort (filter (>= x) xs)
quicksort2 [] = []
quicksort2 (x : xs) = quicksort2 [y | y <- xs, y < x]
++ [x] ++
quicksort2 [y | y <- xs, y >= x]
minisort [] = []
minisort xs = let x = minimum xs
in x : minisort (delete x xs)
排序迷你排序快速排序quicksort2quicksort2到目前为止，我使用的是，与nf，
ghci：set+s[50004999..1]：[Int]benchmarking quicksort
time 2.283 s (2.191 s .. 2.450 s)
0.999 R² (0.998 R² .. 1.000 R²)
mean 2.434 s (2.368 s .. 2.485 s)
std dev 79.23 ms (0.0 s .. 88.75 ms)
variance introduced by outliers: 19% (moderately inflated)
benchmarking quicksort2
time 2.203 s (1.982 s .. 2.455 s)
0.998 R² (0.994 R² .. 1.000 R²)
mean 2.327 s (2.275 s .. 2.359 s)
std dev 49.11 ms (0.0 s .. 56.47 ms)
variance introduced by outliers: 19% (moderately inflated)
benchmarking minisort
time 257.2 ms (229.7 ms .. 276.4 ms)
0.997 R² (NaN R² .. 1.000 R²)
mean 274.4 ms (264.3 ms .. 280.9 ms)
std dev 9.714 ms (2.538 ms .. 12.94 ms)
variance introduced by outliers: 16% (moderately inflated)
quicksort2quicksortminisortfilterbuild/foldr-O3-O2minisortquicksortquicksort2