Breaking News: Grepper is joining You.com. Read the official announcement!

stl sort in c++

Add Answer

Precious Pheasant answered on December 9, 2019 Popularity 10/10 Helpfulness 2/10

answer stl sort in c++

related stl for sorting IN C++

related c++ sort

related sort stl

related how to sort in c++

related c++ std::sort

related c++ sort

related stl sort in c++

related sort c++

stl sort in c++

Comment

sort(arr, arr+n, greater<int>()); // sorts in descending order

Popularity 10/10 Helpfulness 2/10 Language cpp

Source: Grepper

Tags: c++ stl

Link to this answer
Share Copy Link

Contributed on Jun 01 2020

Precious Pheasant

0 Answers Avg Quality 2/10

Closely Related Answers

stl for sorting IN C++

Comment

// STL IN C++ FOR SORING
#include <bits/stdc++.h> 
#include <iostream> 
using namespace std; 
int main() 
{ 
    int arr[] = {1, 5, 8, 9, 6, 7, 3, 4, 2, 0}; 
    int n = sizeof(arr)/sizeof(arr[0]); 
    sort(arr, arr+n);  // ASCENDING SORT
    reverse(arr,arr+n);   //REVERESE ARRAY 
    sort(arr, arr + n, greater<int>());// DESCENDING SORT
  }

Popularity 10/10 Helpfulness 7/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Oct 18 2020

Dull Dormouse

0 Answers Avg Quality 2/10

c++ sort

Comment

#include<bits/stdc++.h>

vector<int> v = { 6,1,4,5,2,3,0};
sort(v.begin() , v.end()); // {0,1,2,3,4,5,6} sorts ascending
sort(v.begin(), v.end(), greater<int>()); // {6,5,4,3,2,1,0} sorts descending

Popularity 10/10 Helpfulness 5/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on May 05 2021

Starless

0 Answers Avg Quality 2/10

sort stl

Comment

1) When using vector:
	sort(arr.begin(), arr.end());

2) When using array:
	sort(arr, arr+n);
	sort(arr, arr+n, greater<int>()); //sorts in descending

Popularity 9/10 Helpfulness 4/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jun 07 2022

Ayush Varma

0 Answers Avg Quality 2/10

how to sort in c++

Comment

#include <bits/stdc++.h>
using namespace std;
  
int main()
{
    int arr[] = { 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 };
    int n = sizeof(arr) / sizeof(arr[0]);
    sort(arr, arr + n);
  
    for (int i = 0; i < n; ++i)
        cout << arr[i] << " ";
    return 0;
}

Popularity 10/10 Helpfulness 4/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jul 14 2022

Raihan Rony

0 Answers Avg Quality 2/10

c++ std::sort

Comment

#include <algorithm>
#include <functional>
#include <array>
#include <iostream>
#include <string_view>
 
int main()
{
    std::array<int, 10> s = {5, 7, 4, 2, 8, 6, 1, 9, 0, 3};
 
    auto print = [&s](std::string_view const rem) {
        for (auto a : s) {
            std::cout << a << ' ';
        }
        std::cout << ": " << rem << '\n';
    };
 
    std::sort(s.begin(), s.end());
    print("sorted with the default operator<");
 
    std::sort(s.begin(), s.end(), std::greater<int>());
    print("sorted with the standard library compare function object");
 
    struct {
        bool operator()(int a, int b) const { return a < b; }
    } customLess;
    std::sort(s.begin(), s.end(), customLess);
    print("sorted with a custom function object");
 
    std::sort(s.begin(), s.end(), [](int a, int b) {
        return a > b;
    });
    print("sorted with a lambda expression");
}

// Output:
//0 1 2 3 4 5 6 7 8 9 : sorted with the default operator<
//9 8 7 6 5 4 3 2 1 0 : sorted with the standard library compare function object
//0 1 2 3 4 5 6 7 8 9 : sorted with a custom function object
//9 8 7 6 5 4 3 2 1 0 : sorted with a lambda expression

Popularity 10/10 Helpfulness 4/10 Language cpp

Source: en.cppreference.com

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jun 15 2022

Jonathan Rochert

0 Answers Avg Quality 2/10

c++ sort

Comment

 int arr[]= {2,3,5,6,1,2,3,6,10,100,200,0,-10};
    int n = sizeof(arr)/sizeof(int);  
    sort(arr,arr+n);

    for(int i: arr)
    {
        cout << i << " ";
    }

Popularity 10/10 Helpfulness 4/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Dec 09 2019

Odey Kassam

0 Answers Avg Quality 2/10

stl sort in c++

Comment

sort(arr, arr+n); // sorts in ascending order

Popularity 10/10 Helpfulness 4/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jun 01 2020

Precious Pheasant

0 Answers Avg Quality 2/10

sort c++

Comment

#include <algorithm>    // std::sort

int myints[] = {32,71,12,45,26,80,53,33};
// using default comparison (operator <):
std::sort (myvector.begin(), myvector.begin()+4);           //(12 32 45 71)26 80 53 33

// fun returns some form of a<b
std::sort (myvector.begin()+4, myvector.end(), myfunction); // 12 32 45 71(26 33 53 80)

Popularity 10/10 Helpfulness 4/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Apr 03 2021

Precious Pheasant

0 Answers Avg Quality 2/10

sort c++

Comment

#include <algorithm>    // std::sort
#include <vector>		// std::vector

std::vector<int> vec = {1,3,2}; // vec = [1, 3, 2]
std::sort (vec.begin(), vec.end()); // vec = [1, 2, 3]

Popularity 10/10 Helpfulness 4/10 Language cpp

Source: cplusplus.com

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jun 28 2022

AartvB

0 Answers Avg Quality 2/10

sort c++

Comment

sort(arr, arr+length); //increase
sort(arr, arr+length, greater<int>()); //decrease

Popularity 10/10 Helpfulness 3/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Apr 01 2021

BreadCode

0 Answers Avg Quality 2/10

stl sort in c++

Contents

More Related Answers

stl sort in c++

Closely Related Answers

stl for sorting IN C++

c++ sort

sort stl

how to sort in c++

c++ std::sort

c++ sort

stl sort in c++

sort c++

sort c++

sort c++

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.