Quick Sort----Go language version

This is a created article in which the information may have evolved or changed.

Quick sort:

One: Principle

The quick sort uses the idea of divide-and-conquer algorithm, selects a fulcrum in the sequence, places the element that is greater than the fulcrum on the right, the element that is less than the fulcrum on the left (ascending), then divides the sequence into two sub-sequences with the fulcrum as the dividing point, then loops to find the fulcrum, swap the elements, and draw the

Second: Performance

The best time complexity is O (n);

The worst time complexity is O (n^2); (The sequence to be sorted is a positive or reverse order);

The average time complexity is O (nlog2n); (The length of the divided sub-series is the same)

Three: Code See: Https://github.com/sunnybird/go/blob/master/quickSort.go

By the way, go without while really not used to ....