Could range-based algorithm be fully independent of (and yet optimized for any) container type?

I was wondering if boost::range or range_v3 will reconciliate free functions and member functions in a similar way that std::begin reconciliate STL containers and C-like arrays (in terms of coding genericity I mean)?

More particularly it would be convenient to me to call std::sort on a list that automatically calls the best possible implementation given by std::list::sort.

At the end, could member functions be seen as interfaces for their generic counterpart only (std::list::sort never called in client code)?