QuickSort.h

Go to the documentation of this file.

// Jolt Physics Library (https://github.com/jrouwe/JoltPhysics)
// SPDX-FileCopyrightText: 2022 Jorrit Rouwe
// SPDX-License-Identifier: MIT
 
#pragma once
 
#include <Jolt/Core/InsertionSort.h>
 
JPH_NAMESPACE_BEGIN
 
template <typename Iterator, typename Compare>
inline void QuickSortMedianOfThree(Iterator inFirst, Iterator inMiddle, Iterator inLast, Compare inCompare)
{
    // This should be guaranteed because we switch over to insertion sort when there's 32 or less elements
    JPH_ASSERT(inFirst != inMiddle && inMiddle != inLast);
 
    if (inCompare(*inMiddle, *inFirst))
        swap(*inFirst, *inMiddle);
 
    if (inCompare(*inLast, *inFirst))
        swap(*inFirst, *inLast);
 
    if (inCompare(*inLast, *inMiddle))
        swap(*inMiddle, *inLast);
}
 
template <typename Iterator, typename Compare>
inline void QuickSortNinther(Iterator inFirst, Iterator inMiddle, Iterator inLast, Compare inCompare)
{
    // Divide the range in 8 equal parts (this means there are 9 points)
    auto diff = (inLast - inFirst) >> 3;
    auto two_diff = diff << 1;
 
    // Median of first 3 points
    Iterator mid1 = inFirst + diff;
    QuickSortMedianOfThree(inFirst, mid1, inFirst + two_diff, inCompare);
 
    // Median of second 3 points
    QuickSortMedianOfThree(inMiddle - diff, inMiddle, inMiddle + diff, inCompare);
 
    // Median of third 3 points
    Iterator mid3 = inLast - diff;
    QuickSortMedianOfThree(inLast - two_diff, mid3, inLast, inCompare);
 
    // Determine the median of the 3 medians
    QuickSortMedianOfThree(mid1, inMiddle, mid3, inCompare);
}
 
template <typename Iterator, typename Compare>
inline void QuickSort(Iterator inBegin, Iterator inEnd, Compare inCompare)
{
    // Implementation based on https://en.wikipedia.org/wiki/Quicksort using Hoare's partition scheme
 
    // Loop so that we only need to do 1 recursive call instead of 2.
    for (;;)
    {
        // If there's less than 2 elements we're done
        auto num_elements = inEnd - inBegin;
        if (num_elements < 2)
            return;
 
        // Fall back to insertion sort if there are too few elements
        if (num_elements <= 32)
        {
            InsertionSort(inBegin, inEnd, inCompare);
            return;
        }
 
        // Determine pivot
        Iterator pivot_iterator = inBegin + ((num_elements - 1) >> 1);
        QuickSortNinther(inBegin, pivot_iterator, inEnd - 1, inCompare);
        auto pivot = *pivot_iterator;
 
        // Left and right iterators
        Iterator i = inBegin;
        Iterator j = inEnd;
 
        for (;;)
        {
            // Find the first element that is bigger than the pivot
            while (inCompare(*i, pivot))
                i++;
 
            // Find the last element that is smaller than the pivot
            do
                --j;
            while (inCompare(pivot, *j));
 
            // If the two iterators crossed, we're done
            if (i >= j)
                break;
 
            // Swap the elements
            swap(*i, *j);
 
            // Note that the first while loop in this function should
            // have been do i++ while (...) but since we cannot decrement
            // the iterator from inBegin we left that out, so we need to do
            // it here.
            ++i;
        }
 
        // Include the middle element on the left side
        j++;
 
        // Check which partition is smaller
        if (j - inBegin < inEnd - j)
        {
            // Left side is smaller, recurse to left first
            QuickSort(inBegin, j, inCompare);
 
            // Loop again with the right side to avoid a call
            inBegin = j;
        }
        else
        {
            // Right side is smaller, recurse to right first
            QuickSort(j, inEnd, inCompare);
 
            // Loop again with the left side to avoid a call
            inEnd = j;
        }
    }
}
 
template <typename Iterator>
inline void QuickSort(Iterator inBegin, Iterator inEnd)
{
    std::less<> compare;
    QuickSort(inBegin, inEnd, compare);
}
 
JPH_NAMESPACE_END