3 ms·
There's a bug in the quicksort implementation example (it assumes all values in the list are unique).
by danielam 10y ago
There's a bug in the quicksort implementation example (it assumes all values in the list are unique).
- eklavya 10y agoAlso in the STM example, they only ever read sender's balance and never the receiver's balance.
- rahulmutt 10y agoGreat catch! I've pushed the update. Should be fixed soon.
- dualogy 10y agoIf I were working on this kind of project, I'd just take code-that-compiles-in-GHC (ie. 1000s of samples --- just put up today for Haskell: https://github.com/metaleap/rosetta-haskell-dump https://github.com/metaleap/rosetta-haskell-dump ) and automatically verify the outputs-of-my-outputs match the GHC-compiled ones ... regardless of the actual real-world merit of said code samples themselves :)