plSorting Class Reference

This class provides implementations of different sorting algorithms. More...

#include <Sorting.h>

Static Public Member Functions
template<typename Container , typename Comparer >
static void	QuickSort (Container &inout_container, const Comparer &comparer=Comparer())
	Sorts the elements in container using a in-place quick sort implementation (not stable).
template<typename T , typename Comparer >
static void	QuickSort (plArrayPtr< T > &inout_arrayPtr, const Comparer &comparer=Comparer())
	Sorts the elements in the array using a in-place quick sort implementation (not stable).
template<typename Container , typename Comparer >
static void	InsertionSort (Container &inout_container, const Comparer &comparer=Comparer())
	Sorts the elements in container using insertion sort (stable and in-place).
template<typename T , typename Comparer >
static void	InsertionSort (plArrayPtr< T > &inout_arrayPtr, const Comparer &comparer=Comparer())
	Sorts the elements in the array using insertion sort (stable and in-place).

Detailed Description

This class provides implementations of different sorting algorithms.

---

The documentation for this class was generated from the following files:

• Code/Engine/Foundation/Algorithm/Sorting.h
• Code/Engine/Foundation/Algorithm/Implementation/Sorting_inl.h