Standard C++ Library Reference ISO/IEC (VERSION3)

template<class RanIt>
void partial_sort(RanIt first, RanIt mid,
RanIt last);
template<class RanIt, class Pr>
void partial_sort(RanIt first, RanIt mid,
RanIt last, Pr pred);
template<class InIt, class RanIt>
RanIt partial_sort_copy(InIt first1, InIt last1,
RanIt first2, RanIt last2);
template<class InIt, class RanIt, class Pr>
RanIt partial_sort_copy(InIt first1, InIt last1,
RanIt first2, RanIt last2, Pr pred);
template<class RanIt>
void nth_element(RanIt first, RanIt nth, RanIt last);
template<class RanIt, class Pr>
void nth_element(RanIt first, RanIt nth, RanIt last,
Pr pred);
template<class FwdIt, class Ty>
FwdIt lower_bound(FwdIt first, FwdIt last,
const Ty& val);
template<class FwdIt, class Ty, class Pr>
FwdIt lower_bound(FwdIt first, FwdIt last,
const Ty& val, Pr pred);
template<class FwdIt, class Ty>
FwdIt upper_bound(FwdIt first, FwdIt last,
const Ty& val);
template<class FwdIt, class Ty, class Pr>
FwdIt upper_bound(FwdIt first, FwdIt last,
const Ty& val, Pr pred);
template<class FwdIt, class Ty>
pair<FwdIt, FwdIt> equal_range(FwdIt first,
FwdIt last, const Ty& val);
template<class FwdIt, class Ty, class Pr>
pair<FwdIt, FwdIt> equal_range(FwdIt first,
FwdIt last, const Ty& val, Pr pred);
template<class FwdIt, class Ty>
bool binary_search(FwdIt first, FwdIt last,
const Ty& val);
template<class FwdIt, class Ty, class Pr>
bool binary_search(FwdIt first, FwdIt last,
const Ty& val, Pr pred);
template<class InIt1, class InIt2, class OutIt>
OutIt merge(InIt1 first1, InIt1 last1,