sort.cpp

gistfile1.txt

template<class Iterator>
void quickSort(Iterator begin, Iterator end)
{
    Iterator pivot = begin;

    if (begin == end) {
        return;
    }

    int i = 1,
    	size = end - begin;

    // Convert the iterator into (pivot,<pivot,>pivot) format
    for (int j = 1; j < size; j++) {
        if (*(begin+j) < *pivot) {
            swap(*(begin+j), *(begin+i));
            i++;
        }
    }

    // Put pivot in the middle
    swap(*pivot, *(begin+i-1));

    // Sort the <pivot and >pivot partitions
    quickSort(begin, begin+i-1);
    quickSort(begin+i,end);
}

vector user2score;
quickSort<vector::iterator>(user2score.begin(), user2score.end());