std::sort

 

C++

言語

コンセプト

ユーティリティライブラリ

ストリングスライブラリ

コンテナライブラリ

アルゴリズムライブラリ

イテレータライブラリ

ニューメリックスライブラリ

入力/出力ライブラリ

ローカライゼーションライブラリ

正規表現ライブラリ(C++11)

アトミック操作ライブラリ(C++11)

スレッドのサポートライブラリ(C++11)

 

アルゴリズムライブラリ

機能します Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
シーケンス動作を非改変 Original: Non-modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
all_of any_of none_of (C++11) (C++11) (C++11) for_each count count_if mismatch equal	find find_if find_if_not (C++11) find_end find_first_of adjacent_find search search_n
シーケンス動作を変更する Original: Modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
copy copy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   (C++11) unique unique_copy
操作を仕切る Original: Partitioning operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
（ソートされた範囲で）ソート操作 Original: Sorting operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
バイナリ検索操作（ソート範囲で） Original: Binary search operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
lower_bound upper_bound	binary_search equal_range
（ソートされた範囲で）操作を設定します Original: Set operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
ヒープ操作 Original: Heap operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
最小値/最大値操作 Original: Minimum/maximum operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
数値演算 Original: Numeric operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
Cライブラリ Original: C library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
qsort	bsearch

 

Defined in header <algorithm>
template<class RandomIt > void sort( RandomIt first, RandomIt last );	(1)
template<class RandomIt, class Compare > void sort( RandomIt first, RandomIt last, Compare comp );	(2)

昇順で範囲[first, last)内の要素を並べ替えます。等しい要素の順序は保持される保証はありません。最初のバージョンは、要素を比較するoperator<使用して、2番目のバージョンは、指定された比較関数compを使用しています.

Original:

Sorts the elements in the range [first, last) in ascending order. The order of equal elements is not guaranteed to be preserved. The first version uses operator< to compare the elements, the second version uses the given comparison function comp.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

パラメータ

first, last	-	ソートする要素の範囲 Original: the range of elements to sort The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
comp	-	比較関数. 最初の値が二つ目の値より小さい 場合、 ​trueを返します. 比較関数のシグネチャは以下と同等でなければなりません.  bool cmp(const Type1 &a, const Type2 &b); シグネチャはconstを含まなくても構いませんが, 比較関数は渡されたオブジェクトを変更してはなりません. The types Type1 and Type2 must be such that an object of type RandomIt can be dereferenced and then implicitly converted to both of them. ​
型の要件
- RandomIt は ValueSwappable and RandomAccessIterator。
- The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible.

値を返します

(なし)

複雑性

O(N·log(N))、N =std::distance(first, last)のcmpアプリケーション.

Original:

O(N·log(N)), where N =std::distance(first, last) applications of cmp.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

例

このコードを実行します

#include <algorithm>#include <functional>#include <array>#include <iostream>   int main(){std::array<int, 10> s{5, 7, 4, 2, 8, 6, 1, 9, 0, 3};   std::sort(s.begin(), s.end());for(int a : s){std::cout<< a <<" ";}std::cout<<'\n';   std::sort(s.begin(), s.end(), std::greater<int>());for(int a : s){std::cout<< a <<" ";}std::cout<<'\n';}

出力:

0 1 2 3 4 5 6 7 8 9 9 8 7 6 5 4 3 2 1 0

参照

partial_sort	ソート範囲の最初のN要素 Original: sorts the first N elements of a range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (関数テンプレート)
stable_sort	ソートされた範囲の要素を等しい要素間の順序を維持しながら Original: sorts a range of elements while preserving order between equal elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (関数テンプレート)