top | item 45365791 (no title) shpongled | 5 months ago There's no problem with randomness in FP?You could use a monad/external state for an OS-level RNG, or define a purely functional PRNG discuss order hn newest shawn_w|5 months ago It's usually quicksorting a linked list, where a random pivot, median of three, etc. are terrible for performance.(Merge sort is of course the natural sort for lists, but qs is like 2 lines of Haskell so it gets demoed for being clever)
shawn_w|5 months ago It's usually quicksorting a linked list, where a random pivot, median of three, etc. are terrible for performance.(Merge sort is of course the natural sort for lists, but qs is like 2 lines of Haskell so it gets demoed for being clever)
shawn_w|5 months ago
(Merge sort is of course the natural sort for lists, but qs is like 2 lines of Haskell so it gets demoed for being clever)