    hi(partial_sort) hi(partial_sort_copy)
    itemization(
        it() Header file: tt(<algorithm>)
        it() Function prototypes:
        itemization(
            itt(void partial_sort([ExecPol,] RandomAccessIterator begin,
    RandomAccessIterator middle, RandomAccessIterator end);)
            itt(void partial_sort([ExecPol,] RandomAccessIterator begin,
    RandomAccessIterator middle, RandomAccessIterator end, 
    BinaryPredicate pred);)

            itt(void partial_sort_copy([ExecPol,] InputIterator begin, 
    InputIterator end, 
    RandomAccessIterator dest_begin, RandomAccessIterator dest_end);)
            itt(void partial_sort_copy([ExecPol,] InputIterator begin, 
    InputIterator end, 
    RandomAccessIterator dest_begin, RandomAccessIterator dest_end, 
    BinaryPredicate pred);)
        )
        it() Description:
            itemization(
            it() The first prototype: the (tt(middle - begin)) smallest
elements are sorted and stored in the range rangett(begin, middle) using the
ti(operator<) of the data type to which the iterators point to compare
elements. The remaining elements of the series remain unsorted, and are stored
in the range rangett(middle, end).
            it() The second prototype: the (tt(middle - begin)) smallest
elements (according to the provided binary predicate tt(pred)) are sorted and
stored in the range rangett(begin, middle). The remaining elements of the
series remain unsorted.
            it() The last two prototypes act like, respectively, the first two
prototypes, but instead of reordering the elements in the source iterator
range the selected elements are copied to the destination iterator range. The
number of elements that are copies is the smaller of the number of
source-iterators and the number of destination iterators.
            )
        it() Example:
        verbinclude(-a examples/partialsort.cc)
    )


