C + + Sort () usage detailed __c++

Sort Sort Usage in C + +
The STL has its own sort function sortsort to sort all the elements in a given interval use this function only with #include <algorithm> 1. Ascending sort

Sort (begin,end), representing a range, example:
#include <algorithm>
int main ()
{
 int a[20]={ 2,4,1,23,5,76,0,43,24,65},i;
 for (i=0;i<20;i++)
  cout<<a[i]<<endl;
 Sort (a,a+20);
 for (i=0;i<20;i++)
 cout<<a[i]<<endl;
 return 0;
}

2. Descending sort

You write a comparison function to implement it, and then call the three-parameter Sort:sort (begin,end,compare). For the list container, this method is also applicable, and the compare as a sort parameter is OK

Write your own compare function:
bool Compare (int a,int b)
{return
  a<b;//ascending order, if change to return a>b, descending, a<b to ascending
}# Include <algorithm>
int main ()
{
  int a[20]={2,4,1,23,5,76,0,43,24,65},i;
  for (i=0;i<20;i++)
  cout<<a[i]<<endl;
  Sort (a,a+20,compare);
  for (i=0;i<20;i++)
  cout<<a[i]<<endl;
  return 0;
}