QuickSort.h File Reference

#include <Jolt/Core/InsertionSort.h>

Go to the source code of this file.

Functions
template<typename Iterator , typename Compare >
JPH_NAMESPACE_BEGIN void	QuickSortMedianOfThree (Iterator inFirst, Iterator inMiddle, Iterator inLast, Compare inCompare)
	Helper function for QuickSort, will move the pivot element to inMiddle.
template<typename Iterator , typename Compare >
void	QuickSortNinther (Iterator inFirst, Iterator inMiddle, Iterator inLast, Compare inCompare)
	Helper function for QuickSort using the Ninther method, will move the pivot element to inMiddle.
template<typename Iterator , typename Compare >
void	QuickSort (Iterator inBegin, Iterator inEnd, Compare inCompare)
	Implementation of the quick sort algorithm. The STL version implementation is not consistent across platforms.
template<typename Iterator >
void	QuickSort (Iterator inBegin, Iterator inEnd)
	Implementation of quick sort algorithm without comparator.

Function Documentation

QuickSort() [1/2]

template<typename Iterator >

void QuickSort ( Iterator inBegin, Iterator inEnd )

inline

Implementation of quick sort algorithm without comparator.

QuickSort() [2/2]

template<typename Iterator , typename Compare >

void QuickSort ( Iterator inBegin, Iterator inEnd, Compare inCompare )

inline

Implementation of the quick sort algorithm. The STL version implementation is not consistent across platforms.

QuickSortMedianOfThree()

template<typename Iterator , typename Compare >

JPH_NAMESPACE_BEGIN void QuickSortMedianOfThree ( Iterator inFirst, Iterator inMiddle, Iterator inLast, Compare inCompare )

inline

Helper function for QuickSort, will move the pivot element to inMiddle.

QuickSortNinther()

template<typename Iterator , typename Compare >

void QuickSortNinther ( Iterator inFirst, Iterator inMiddle, Iterator inLast, Compare inCompare )

inline

Helper function for QuickSort using the Ninther method, will move the pivot element to inMiddle.