Sorting algorithm accumulation (2)

Reprint: http://blog.csdn.net/sunshangjin/article/details/40296357

Think of themselves every day sort of sort, bubbling ah, binary search Ah, the results in the STL with the sorting function Sort,qsort, finally freed himself ~

The Std::sort () function is powerful and can be used to sort elements such as classes, structs, and so on. C++sort Reference Manual

So I summed up a bit, first look at the sort function in the following table: Reference csdn

Name of function	function Description
Sort	Sort all elements of a given interval
Stable_sort	Stable ordering of all elements in a given interval
Partial_sort	Sort all elements of a given interval
Partial_sort_copy	Copy and sort the given interval
Nth_element	Find the element corresponding to a position in a given interval
is_sorted	Determine if an interval has been sequenced.
Partition	Put elements that meet a certain condition in front
Stable_partition	Relatively stable so that elements that meet a certain condition are placed in front

To use this function just use # include <algorithm>

Sort can be used with the syntax described as:

Sort (begin,end), which represents a range, for example:

[CPP]View PlainCopy

2. #include <iostream>
4. #include <algorithm>
6. #include <string>
8. Using namespace std;
10. int main ()
12. {
14. int a[10]={9,12,17,30,50,20,60,65,4,49};
16. Sort (a,a+10);
18. For (int i=0;i<10;i++)
20. cout<<a[i]<<";
22. cout<<endl;
24. return 0;
26. }

2) Write a comparison function to implement, then call the three parameters of the Sort:sort (Begin,end,compare) becomes. For the list container, this method also applies, compare as a sort parameter, namely: Sort (Compare).

[CPP]View PlainCopy

2. #include <iostream>
4. #include <algorithm>
6. #include <string>
8. Using namespace std;
10. BOOL Compare (int A,int b)
12. {
14. return a<b; //default ascending order, or descending if return a>b is changed
16. }
18. BOOL Compare_decrease (int A,int b)
20. {
22. return a>b; //From a large to a small arrangement
24. }
26. int main ()
28. {
30. int a[10]={9,12,17,30,50,20,60,65,4,49};
32. Sort (a,a+10);
34. For (int i=0;i<10;i++)
36. cout<<a[i]<<";
38. cout<<endl;
40. Sort (a,a+10,compare_decrease);
42. For (int i=0;i<10;i++)
44. cout<<a[i]<<";
46. cout<<endl;
48. return 0;
50. }

PS: Generally not used for string sorting

Sorting algorithm accumulation (2)