Binary quicksort for Go.
Binary quicksort is a in-space binary MSD radix sort. This is not a stable sort. In the worst case, this sort takes O(n*k) evaluation and uses O(k) space complexity, where n is the element count and k is the number of bits in the max key value.
This algorithm is advantageous when the number of keys is limited and the number of elements is large.
See: pkg.go.dev