Publisher review:Templated Quicksort is a quicksort algorithm which can be used with any data type that can make use of the < operator. This is a quicksort algorithm which can be used with any data type that can make use of the < operator. You pass in a vector of the data type and the algorithm sorts it.
The algorithm works by splitting the vector into 2 (hopefully) equal parts. It recursively does this until the 2 parts are so small that determining which part goes where becomes a trivial matter. After the vector is split and sorted, they are combined to for the original, in sorted order.
This algorithm will sort in ascending order regardless of data type (assuming the < operator is functioning properly). This algorithm is notan in place algorithm. It will use exponentially large amounts of memory as the amount of values in the vector increase. Also note that this algorithm has an O(n^2) worst case complexity and must assumed for all production purposes.
Templated Quicksort is a C/C++ script for Polls and Voting scripts design by NDawg.
It runs on following operating system: Windows.
Operating system:Windows
Templated Quicksort script details 
