Go’s sorting algorithm for Go has changed to something called “pdqsort” The previous algorithm, Quicksort, has a quadratic complexity. This means it has a worst case performance of O(n ^ 2)⁵ . The new algorithm attempts to avoid the worst-case scenario by moving things around.
2 Comments
Sort: