From the usage of Sort(begin,end) it appears that by just specifying the containers beginning and ending index the function can sort a container. But my question how does the sort function gets the type of containers.
std::sort(myvector.begin(), myvector.end());
From the above code I assume the starting and end index is send. How come the vector type and the vector name is deduced.
The function std::sort, like many others from <algorithm>, does not care about the container type because it works with concepts.
Specifically, the function is defined as:
template< class RandomIt >
void sort( RandomIt first, RandomIt last );
As you can see, templates are used to express the concept of ValueSwappable and RandomAccessIterator iterators.
myvector.begin()/end() returns type "containertype::iterator"
As to how the sort() works, it actually doesn't care about the underlying container type, as long as the two elements in the container are comparable (either less<type>() exist for that element, or you specify your own comparing function).
ValueSwappable and RandomAccessIterator requirements.
std::sortwith astd::list