Comment on Trying HaskellparentComments−jmillikin15yHaskell has mutable data structures; you could easily implement in-place quicksort with vectors, arrays, or pointers.
Comments
Haskell has mutable data structures; you could easily implement in-place quicksort with vectors, arrays, or pointers.