I'm taking a look at Go
, and was trying to find idiomatic implementations of classic algorithms to get a feel for the language.
I chose quicksort because I'm particularly interested in the arrays vs slices, in-place vs copy deal. After I settle some concepts down, I want to write a parallel impl.
Can someone please show me an idiomatic implementation of quicksort in Go
?