Standard C++ Library User Guide and Tutorial

Click on the banner to return to the user guide home page.

Overview

In this section we will describe the generic algorithms in the standard library that are specific to

ordered collections. These are summarized by the following table:

Name Purpose

Sorting Algorithms

Sections Sorting Algorithms and Partial Sort

sort rearrange sequence, place in order

stable_sort sort, retaining original order of equal

elements

partial_sort sort only part of sequence

partial_sort_copy partial sort into copy

Find Nth largest Element

Section nth Element

nth_element locate nth largest element

Binary Search

Section Binary Search

binary_search search, returning boolean

lower_bound search, returning first position

upper_bound search, returning last position

equal_range search, returning both positions

Merge Ordered Sequences

Section Merge Ordered Sequences

merge combine two ordered sequences

Set Operations

Section Set Operations