Space Complexity: O(1), constant additional space is used.

Sorting

Algorithm

Sorting refers to arrange all elements of array in either ascending or descending order. Sorting helps in implementing many algorithms such as binary search and many others. Common ways of sorting are bubble sort, merge sort, quick sort and many others.

Code

#include <bits/stdc++.h>
using namespace std;

int main() {
    // Initial array
    int arr[] = {2, 3, 9, 4, 7, 1};
    int n = 6;

    // Inbuilt function for sorting
    sort(arr, arr + n);

    // Loop to print sorted array
    for (int i = 0; i < n; i++) {
        cout << arr[i] << " ";
    }

    return 0;
}
import java.util.Arrays;

public class Main {
    public static void main(String[] args) {
        // Initial array
        int[] arr = {2, 3, 