here’s a list of the algorithms that require the data on which they operate to be sorted:
binary_search lower_bound
upper_bound equal_range
set_union set_intersection
set_difference set_symmetric_difference
merge inplace_merge
includes
In addition, the following algorithms are typically used with sorted ranges, though they do not require them:
unique unique_copy