hi(sort) hi(stable_sort)
    itemization(
        it() Header file: tt(<algorithm>)
        it() Function prototypes:
        itemization(
            itt(void sort([ExecPol,] RandomAccessIterator first,
                RandomAccessIterator last);)
            itt(void sort([ExecPol,] RandomAccessIterator first,
                RandomAccessIterator last, Compare comp);)
            itt(void stable_sort([ExecPol,] RandomAccessIterator first,
                RandomAccessIterator last);)
            itt(void stable_sort([ExecPol,] RandomAccessIterator first,
                RandomAccessIterator last, Compare comp);)
        )
        it() Description:
        itemization(
           it() The first prototype: the elements in the range rangett(first,
last) are sorted in ascending order using ti(operator<) of the data type to
which the iterators point.
            it() The second prototype: the elements in the range
rangett(first, last) are sorted in ascending order using the tt(comp)
function object to compare the elements. The binary predicate tt(comp)
should return tt(true) if its first argument should be placed earlier in the
sorted sequence than its second argument.
           it() The last two prototypes are used identically to the first two
prototypes, but use stable-sorting, keeping the initial order of equal
elements. 
        )
        it() Example:
        verbinclude(-a examples/sort.cc)
        The example also shows two generic algorithms using the
tt(execution::par) execution policy: first tt(generate) is used to fill an
array with randomly determined tt(int)-values, then tt(sort) is used to sort
those values.
    )
