Of course Rust is faster and all, but just look at Haskell code 😮 (parenthesis around flip filter are unnecessary btw)<br /><br /><br />This is the comparison between Quick array Sort algorithm written in Rust (I found the code on GitHub) and Haskell (I wrote the code). Turns out, Rust code is obscenely big, while Haskell is pretty elegant 😊. I know, Haskell implementation is not "true" quick sort as it is not "in place", but it is beautiful!!1<br /><br /><br /><br />Music: my unreleased track; "Arcadia" Kevin MacLeod (incompetech.com) (CC-BY 4.0)<br />...<br /><a href="https://www.youtube.com/watch?v=sdD8WiFp0Qo" target="_blank" rel="nofollow">https://www.youtube.com/watch?v=sdD8WiFp0Qo</a>