sort函数的用法（The use of sort functions）.docVIP

sort函数的用法（The use of sort functions） The use of sort functions When you do ACM questions, sorting is often a required operation. If every time I write a bubble sort of O (n^2) sorting, not only the program is easy to overtime, but also wasting valuable game time, it is likely to make mistakes. STL, there is a sort function, you can directly sort the array, the complexity is n*log2 (n). To use this function, you need to include the header file. This function can pass two arguments or three arguments. The first parameter is the first address of the interval to be sorted, and the next address where the second parameter is the range end address. That is, the sorting interval is [a, B). In simple terms, there is an array of int a[100], which you want to sort the elements from a[0] to a[99], just write sort (a, a+100), and the default sort is ascending. Take my ACs policy question, which requires the sorting of zeroth to len-1 elements in the logarithm group T, and sort (T, t+len); The same is true for vector V, sort (v.begin (), v.end ()); Sorted data types are not limited to integers, as long as they are defined by types less than operations, such as string classes string. If there is no data type that is smaller than the calculation, or if you want to change the order of the sorting, you need the third parameter -- the comparison function. A comparison function is a function that is defined by itself. The return value is bool, which specifies what relationship is less than. You can define a comparison function CMP in order to put the array of integers in descending order Bool CMP (int, a, int, b) { Return ab; } When sorting, write sort (a, a+100, CMP); Suppose you have defined a structure, node Struct node{ Int a; Int b; Double c; } There is an array of node type node arr[100], which you want to sort: first by ascending the a value, and if the a value is the same, then put the b values in descending order, and if B is the same, rank them in descending order of C. You c