C++ quicksort :|

    #include <algorithm>
    #include <iterator>
    #include <functional>
    using namespace std;
 
    template <typename T>
    void sort(T begin, T end) {
        if (begin != end) {
            T middle = partition (begin, end,   bind2nd(less<iterator_traits<T>::value_type>(), *begin));
            sort (begin, middle);
            sort (max(begin + 1, middle), end);
        }
    }

from wikipedia