* Alf P. Steinbach:
* vicky:
On Feb 15, 1:29 am, Andr? Schreiter <andre.schrei...@gmx.de> wrote:
Am 15.02.2010 10:18, schrieb vicky:
i declares a vector and uses its sort function, acc. to a tutorial.
std::vector hasn't a sort function. Use the header <algorithm>:
#include <algorithm>
#include <vector>
...
std::vector<int> c;
...
std::sort(c.begin(), c.end());
...
but i m reading a book of "Nicolai M. Josuttis". it is highly
recommended one.He has used it many a times.
Is it like it was before and now removed.?
I think you may have seen use of
list<int> someList;
someList.sort()
but not vector.
It may not appear to be very unified, but the unification is via the
std::sort routine.
The headers for types like vector and sort provide overloads of
std::sort where appropriate. For a type where there's no such override
std::sort uses a general algorithm that requires random access, like
indexing of a vector. But that doesn't work for std::list, so std::list
has a sort() member function (presumably it uses merge sorting or some
such that's better suited for linked lists), and overrides std::sort to
call that member function.
Cheers & hth.,
- Alf
Sorry about the brain-to-keyboard errors. I meant to write headers for types
like vector and list, and at the end there I meant to write overload not override.