Quick Sort implementation in Go (Golang).
Time Complexity:
Worst: O(n^2)
Best: O(n log(n))
Average: O(n log(n))
Space Complexity: O(log(n))
$ go test -v -cover ./...
=== RUN TestCase
--- PASS: TestCase (0.00s)
PASS
coverage: 91.7% of statements
ok github.com/mxssl/QuickSortGolang 0.005s coverage: 91.7% of statements