4 ms·
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
by shpongled 1y 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
- shawn_w 1y agoIt'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)