sort pdqsort_branchless

Giriş
quick sort gibidir. Açıklaması şöyle

Boost's quicksort and the STL's std::sort are very close together in runtime performance.

Örnek
Şöyle yaparız

#include <boost/sort/pdqsort/pdqsort.hpp>

using namespace boost::sort; 

vector<int> arr = ...;
pdqsort_branchless(arr.begin(), arr.end(),[](const int &a, const int &b){return (a<b);});