(原創) 如何使用C++的標準函式庫進行排序? (C/C++) (STL)
Abstract
前一篇(原創) 如何使用C語言的標準函式庫進行排序? (C)談到使用C語言stdlib.h的qsort()對array進行排序,C++呢?STL也提供了sort() algorithm。
Introduction
STL的sort()不僅僅支援array,還支援其餘的container如vector,list等,這也是泛型之美,container和algorithm徹底decouple,讓algorithm可以支援各種container,達到最大的reuse,由於STL是C++ 98的標準,所以跨平台不是問題。
GenericAlgo_sort.cpp
1
/*
2
(C) OOMusou 2007 http://oomusou.cnblogs.com
3![](/Images/OutliningIndicators/InBlock.gif)
4
Filename : GenericAlgo_sort.cpp
5
Compiler : Visual C++ 8.0
6
Description : Demo how to use sort()
7
Release : 01/29/2008 1.0
8
*/
9![](/Images/OutliningIndicators/None.gif)
10
#include <iostream>
11
#include <algorithm>
12
#include <functional>
13![](/Images/OutliningIndicators/None.gif)
14
using namespace std;
15![](/Images/OutliningIndicators/None.gif)
16
int main() {
17
int ia[] = {2, 3, 1 ,3 ,5};
18
int arr_size = sizeof(ia) / sizeof(int);
19
20
copy(ia, ia + arr_size, ostream_iterator<int>(cout, " "));
21![](/Images/OutliningIndicators/InBlock.gif)
22
cout << endl;
23
24
sort(ia, ia + arr_size);
25
// sort(ia, ia + arr_size, less<int>()); // OK
26
27
copy(ia, ia + arr_size, ostream_iterator<int>(cout, " "));
28
}
![](/Images/OutliningIndicators/ExpandedBlockStart.gif)
2
![](/Images/OutliningIndicators/InBlock.gif)
3
![](/Images/OutliningIndicators/InBlock.gif)
4
![](/Images/OutliningIndicators/InBlock.gif)
5
![](/Images/OutliningIndicators/InBlock.gif)
6
![](/Images/OutliningIndicators/InBlock.gif)
7
![](/Images/OutliningIndicators/InBlock.gif)
8
![](/Images/OutliningIndicators/ExpandedBlockEnd.gif)
9
![](/Images/OutliningIndicators/None.gif)
10
![](/Images/OutliningIndicators/None.gif)
11
![](/Images/OutliningIndicators/None.gif)
12
![](/Images/OutliningIndicators/None.gif)
13
![](/Images/OutliningIndicators/None.gif)
14
![](/Images/OutliningIndicators/None.gif)
15
![](/Images/OutliningIndicators/None.gif)
16
![](/Images/OutliningIndicators/ExpandedBlockStart.gif)
17
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
18
![](/Images/OutliningIndicators/InBlock.gif)
19
![](/Images/OutliningIndicators/InBlock.gif)
20
![](/Images/OutliningIndicators/InBlock.gif)
21
![](/Images/OutliningIndicators/InBlock.gif)
22
![](/Images/OutliningIndicators/InBlock.gif)
23
![](/Images/OutliningIndicators/InBlock.gif)
24
![](/Images/OutliningIndicators/InBlock.gif)
25
![](/Images/OutliningIndicators/InBlock.gif)
26
![](/Images/OutliningIndicators/InBlock.gif)
27
![](/Images/OutliningIndicators/InBlock.gif)
28
![](/Images/OutliningIndicators/ExpandedBlockEnd.gif)
執行結果
2 3 1 3 5
1 2 3 3 5 請按任意鍵繼續 . . .
1 2 3 3 5 請按任意鍵繼續 . . .
20行和27行只是透過copy()將目前的陣列顯示出來,不是重點。
24行的sort()才是真正的對陣列作排序,第一個參數為陣列的起始元素記憶體位址,第二個參數為陣列最後一個元素的記憶體位址,由於sort()預設就是由小排到大,因此可以忽略第三個參數,當然如26行加上less<int>()這個predicate亦可。
Conclusion
本文我們看到了使用C++的方式作排序,使用STL的sort() algorithm。
See Also
(原創) 如何使用C語言的標準函式庫進行排序? (C)