c++ standard sorting algorithm code example
Example 1: stl for sorting IN C++
// 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
}
Example 2: sorting algorithm c++
#include<iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int numb[7];
int i, j;
for(i=0;i<=6;i++)
{
cout << "Enter a number" << endl;
cin >> numb[i];
}
for (i=0;i<=5;i++)
{
for (j=i+1;j<=5;j++)
{
int temp;
if (numb[i] > numb[j])
{
temp = numb[i];
numb[i] = numb[j];
numb[j] = temp;
}
}
}
for (i=0;i<=6;i++)
{
cout << endl << numb[i] << endl;
}
}