Step by Step solution about How to resolve the algorithm Sort an integer array step by step in the C++ programming language

The three examples show how to sort a collection of integers in C++.

First example:

• An array of integers is created and initialised with the values {2, 4, 3, 1, 2}.
• The std::sort function is called to sort the array in ascending order. The function takes two arguments: the beginning and the end of the range to be sorted. In this case, the entire array is sorted.
• The array is now sorted, and the values are {1, 2, 2, 3, 4}.

Second example:

• A vector of integers is created.
• Five integers are added to the vector using the push_back method.
• The std::sort function is called to sort the vector in ascending order. The function takes two arguments: the beginning and the end of the range to be sorted. In this case, the entire vector is sorted.
• The vector is now sorted, and the values are {1, 2, 2, 3, 4}.

Third example:

• A list of integers is created.
• Five integers are added to the list using the push_back method.
• The sort method is called to sort the list in ascending order.
• The list is now sorted, and the values are {1, 2, 2, 3, 4}.

#include <algorithm>

int main()
{
    int nums[] = {2,4,3,1,2};
    std::sort(nums, nums+sizeof(nums)/sizeof(int));
    return 0;
}


#include <algorithm>
#include <vector>

int main()
{
    std::vector<int> nums;
    nums.push_back(2);
    nums.push_back(4);
    nums.push_back(3);
    nums.push_back(1);
    nums.push_back(2);
    std::sort(nums.begin(), nums.end());
    return 0;
}


#include <list>

int main()
{
    std::list<int> nums;
    nums.push_back(2);
    nums.push_back(4);
    nums.push_back(3);
    nums.push_back(1);
    nums.push_back(2);
    nums.sort();
    return 0;
}