std::sort 排序使用方法

//<br />//alg_std::sort.cpp<br />//<br />#include <vector><br />#include <algorithm><br />#include <functional> // For greater<int>( )<br />#include <iostream><br />using namespace std;</p><p>// Return whether first element is greater than the second<br />bool UDgreater ( int elem1, int elem2 )<br />{<br />return elem1 > elem2;<br />}</p><p>class Csort<br />{<br />public:</p><p>// Return whether first element is less than the second<br />bool operator () (int a,int b) const<br />{<br />return a<b;<br />};<br />};</p><p>int main( )<br />{<br />vector <int> v1;<br />vector <int>::iterator Iter1;<br />int arr[12];<br />int i;<br />for ( i = 0 ; i <= 5 ; i++ )<br />{<br />v1.push_back( 2 * i );<br />arr[i]=2*i;<br />}<br />for ( i = 6 ; i <= 11 ; i++ )<br />{<br />arr[i]=23-2*i;<br />}</p><p>int ii;<br />for ( ii = 0 ; ii <= 5 ; ii++ )<br />{<br />v1.push_back( 2 * ii + 1 );<br />}</p><p>cout << "Original vector v1 = ( " ;<br />for ( Iter1 = v1.begin( ) ; Iter1 != v1.end( ) ; Iter1++ )<br />cout << *Iter1 << " ";<br />cout << ")" << endl;<br />cout << "Original array arr = ( " ;<br />for ( int n=0;n<12;n++ )<br />cout << arr[n] << " ";<br />cout << ")" << endl;</p><p>//std::sort 預設排序方式<br />sort( v1.begin( ), v1.end( ) );<br />cout << "Sorted vector v1 = ( " ;<br />for ( Iter1 = v1.begin( ) ; Iter1 != v1.end( ) ; Iter1++ )<br />cout << *Iter1 << " ";<br />cout << ")" << endl;</p><p>//使用自訂函數給數組排序，第三個參數為函數指標UDgreater<br />//第二個參數為資料最大地址的後一位指標&arr[12]；<br />sort( &arr[0], &arr[12],UDgreater);</p><p>cout << "Resorted (UDgreater) array arr = ( " ;<br />for ( int n=0;n<12;n++ ) cout << arr[n] << " ";<br />cout << ")" << endl;<br />//使用自訂類的 重載operator() 函數給數組排序，第三個參數為【類名()】<br />sort( &arr[0], &arr[12],Csort());</p><p>cout << "Resorted (Csort()) arr = ( " ;<br />for ( int n=0;n<12;n++ ) cout << arr[n] << " ";<br />cout << ")" << endl;</p><p>//使用<functional>庫中 greater<int>( ) 給向量V1排序；<br />sort( v1.begin( ), v1.end( ), greater<int>( ) );<br />//sort( v1.begin( ), v1.end( ), Csort() );</p><p>cout << "Resorted (greater) vector v1 = ( " ;<br />for ( Iter1 = v1.begin( ) ; Iter1 != v1.end( ) ; Iter1++ )<br />cout << *Iter1 << " ";<br />cout << ")" << endl;</p><p>// A user-defined (UD) binary predicate can also be used<br />//sort( v1.begin( ), v1.end( ), UDgreater );<br />sort( v1.begin( ), v1.end( ),Csort());<br />cout << "Resorted (UDgreater) vector v1 = ( " ;<br />for ( Iter1 = v1.begin( ) ; Iter1 != v1.end( ) ; Iter1++ )<br />cout << *Iter1 << " ";<br />cout << ")" << endl;</p><p>getchar();<br />return 0;<br />}