On Fri, 4 Aug 2017, Oleg Endo wrote: > > Note that with vec::qsort -> vec::sort renaming (which should be less > > controversial, STL also has std::vector<T>::sort) > > No it doesn't? One uses std::sort from <algorithm> on a pair of random > access iterators to sort a std::vector.
My mistake, but the main point remains: STL uses 'sort' without the 'q'. Thanks. Alexander
