3 ms·
`sort(begin(foo), end(foo))` Has worked in C++ for ~25 years as long as `foo` is a container of items with an `operator<`. It has never required defining a sep
by dataangel 5y ago
`sort(begin(foo), end(foo))`
Has worked in C++ for ~25 years as long as `foo` is a container of items with an `operator<`. It has never required defining a separate class. It will also optimize better than qsort when qsort fails to inline.
- slavik81 5y agoYour main point is correct, but std::begin and std::end were added in C++11. You would have used pointers or begin/end member functions for most of those 25 years.
- deleted 5y ago[deleted]
- deleted 5y ago[deleted]