sort array ascending order numbers c++ code example

Example 1: c++ how to sort numbers in ascending order

// With the first loop we take a number of the array(x). 
    // With the second we take all the numbers in the array except x.
	// So we can compare each number with all the other numbers(9)

int arr[] = { 9, 8 , 3 , 5, 1, 2 , 0 , 4, 10,6 }; // System Input.
	for (int i = 0; i < 10; i++)     // For loop running array lenght times(10).
	{
		for (int j = i + 1; j < 10; j++) // For loop running 9 times(other nums).	
		{
			if (arr[i] > arr[j]) // Checking if current num(x) is larger than the next num(j).
			{
				
				int temp = arr[i]; // Storing current num(x)
				arr[i] = arr[j]; // Making i number equal to the next num(j).
				arr[j] = temp;  // Making the next number qeual to temp(i).
			}	
		}      	// SWITCHING PLACES WITH THE CURRENT AND THE NEXT NUM.
	}

	for (int i = 0; i < 10; i++)  // For loop running array lenght times(10).
	{
		cout << arr[i] << endl; // printing all the numbers!

	}

Example 2: c++ sort array of ints

// C++ program to demonstrate default behaviour of 
// sort() in STL. 
#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); 
  
    cout << "\nArray after sorting using "
         "default sort is : \n"; 
    for (int i = 0; i < n; ++i) 
        cout << arr[i] << " "; 
  
    return 0; 
}