Sorting With the sort() Algorithm

Sorting With the sort() Algorithm

The generic algorithm sort() is part of the Standard Library. sort() takes two arguments of type const iterator that point to the beginning and the end of the sequence respectively:

 #include #include  //definition of sort()#include using namespace std;void main(){  vector  vi;  vi.push_back(7);   vi.push_back(1);  vi.push_back(19);  sort(vi.begin(), vi.end() );   // sort vi; default is ascending order  cout<< vi[0]  <<", "<< vi[1] <<", "<< vi[2] <

When a descending order is preferred, you can use reverse iterators:

 sort(vi.rbegin(), vi.rend() ); // now sort in descending order cout<< vi[0] <<", "<
See also  Is Machine Learning Automating Creativity in Graphic Design?

About Our Editorial Process

At DevX, we’re dedicated to tech entrepreneurship. Our team closely follows industry shifts, new products, AI breakthroughs, technology trends, and funding announcements. Articles undergo thorough editing to ensure accuracy and clarity, reflecting DevX’s style and supporting entrepreneurs in the tech sphere.

See our full editorial policy.

About Our Journalist