Sort 3 numbers

23 Jun, 2022
Given three numbers, how to sort them?
Examples: 
Input  : arr[] = {3, 2, 1}
Output : arr[] = {1, 2, 3}

Input : arr[] = {6, 5, 0}
Output :arr[] = {0, 5, 6}
One simple solution is to use sort function.  
C++
Java
Python3
C#
PHP
Javascript
// C++ program to sort an array of size 3#include <algorithm>#include <iostream>using namespace std; int main(){    int a[] = {10, 12, 5};     sort(a, a + 3);     for (int i = 0; i < 3; i++)        cout << a[i] << " ";     return 0;}
// Java program to sort// an array of size 3import java.io.*;import java .util.*; class GFG{    public static void main (String[] args)    {        int a[] = {10, 12, 5};         Arrays.sort(a);         for (int i = 0; i < 3; i++)            System.out.print( a[i] + " ");    }} // This code is contributed// by inder_verma.
# Python3 program to sort# an array of size 3a = [10, 12, 5]a.sort()for i in range(len(a)):    print(a[i], end = ' ') # This code is contributed# by Samyukta S Hegde
// C# program to sort// an array of size 3using System;class GFG{    public static void Main ()    {        int []a = {10, 12, 5};         Array.Sort(a);         for (int i = 0; i < 3; i++)         Console.Write( a[i] + " ");    }} // This code is contributed// by chandan_jnu.
<?php// PHP program to sort// an array of size 3$a = array(10, 12, 5); sort($a); for ($i = 0; $i < 3; $i++)    echo $a[$i] , " "; // This code is contributed// by chandan_jnu.?>
<script> // Javascript program to sort an array of size 3let arr = [10, 12, 5]; arr.sort((a, b) => a - b); for (let i = 0; i < 3; i++)document.write(arr[i] + " "); // This code is contributed by Jana_Sayantan.</script>
5 10 12
 
Time Complexity: O(1)Auxiliary Space: O(1)
How to write our own sort function that does minimum comparison and does not use extra variables? The idea is to use insertion sort as insertion sort works best for small arrays.
C++
Java
Python3
C#
PHP
Javascript
// C++ program to sort an array of size 3#include <algorithm>#include <iostream>using namespace std; int sort3(int arr[]){    // Insert arr[1]    if (arr[1] < arr[0])       swap(arr[0], arr[1]);     // Insert arr[2]    if (arr[2] < arr[1])    {       swap(arr[1], arr[2]);       if (arr[1] < arr[0])          swap(arr[1], arr[0]);    }} int main(){    int a[] = {10, 12, 5};         sort3(a);     for (int i = 0; i < 3; i++)        cout << a[i] << " ";     return 0;}
// Java program to sort// an array of size 3import java.io.*;import java.util.*; class GFG{static void sort3(int arr[],                  int temp[]){    // Insert arr[1]    if (arr[1] < arr[0])        {            temp[0] = arr[0];            arr[0] = arr[1];            arr[1] = temp[0];        }     // Insert arr[2]    if (arr[2] < arr[1])    {            temp[0] = arr[1];            arr[1] = arr[2];            arr[2] = temp[0];                 if (arr[1] < arr[0])        {            temp[0] = arr[0];            arr[0] = arr[1];            arr[1] = temp[0];        }    }} // Driver Codepublic static void main(String args[]){    int a[] = new int[]{10, 12, 5};    int temp1[] = new int[10];    sort3(a, temp1);     for (int i = 0; i < 3; i++)        System.out.print( a[i] + " ");}} // This code is contributed// by Akanksha Rai(Abby_akku)
# Python3 program to sort an array of size 3def sort3(arr):         # Insert arr[1]    if (arr[1] < arr[0]):        arr[0], arr[1] = arr[1], arr[0]             # Insert arr[2]    if (arr[2] < arr[1]):        arr[1], arr[2] = arr[2], arr[1]        if (arr[1] < arr[0]):            arr[1], arr[0] = arr[0], arr[1]     # Driver codea = [10, 12, 5] sort3(a) for i in range(3):    print(a[i],end=" ")     # This code is contributed by shubhamsingh10
// C# program to sort// an array of size 3using System; class GFG {     static void sort3(int []arr, int []temp){         // Insert arr[1]    if (arr[1] < arr[0])        {            temp[0] = arr[0];            arr[0] = arr[1];            arr[1] = temp[0];        }     // Insert arr[2]    if (arr[2] < arr[1])    {        temp[0] = arr[1];        arr[1] = arr[2];        arr[2] = temp[0];                     if (arr[1] < arr[0])        {            temp[0] = arr[0];            arr[0] = arr[1];            arr[1] = temp[0];        }    }}     // Driver Code    public static void Main(String []args)    {        int []a= new int[]{10, 12, 5};        int []temp1 = new int[10];        sort3(a, temp1);             for (int i = 0; i < 3; i++)            Console.Write( a[i] + " ");    }} // This code is contributed// by Akanksha Rai(Abby_akku)
<?php// PHP program to sort an array of size 3function sort3(&$arr, $temp){    // Insert arr[1]    if ($arr[1] < $arr[0])    {        $temp[0] = $arr[0];        $arr[0] = $arr[1];        $arr[1] = $temp[0];    }     // Insert arr[2]    if ($arr[2] < $arr[1])    {        $temp[0] = $arr[1];        $arr[1] = $arr[2];        $arr[2] = $temp[0];    }         if ($arr[1] < $arr[0])    {        $temp[0] = $arr[0];        $arr[0] = $arr[1];        $arr[1] = $temp[0];    }} // Driver Code$a = array(10, 12, 5);$temp1 = array(10);sort3($a, $temp1); for ($i = 0; $i < 3; $i++)    echo($a[$i] . " "); // This code is contributed// by Code_Mech.?>
<script> // Javascript program to sort an// array of size 3function sort3(arr, temp){         // Insert arr[1]    if (arr[1] < arr[0])    {        temp[0] = arr[0];        arr[0] = arr[1];        arr[1] = temp[0];    }     // Insert arr[2]    if (arr[2] < arr[1])    {        temp[0] = arr[1];        arr[1] = arr[2];        arr[2] = temp[0];         if (arr[1] < arr[0])        {            temp[0] = arr[0];            arr[0] = arr[1];            arr[1] = temp[0];        }    }} // Driver codelet a = [ 10, 12, 5 ];let temp1 = [10];sort3(a, temp1); for(let i = 0; i < 3; i++)    document.write( a[i] + " ");     // This code is contributed by decode2207 </script>
5 10 12
 
Time Complexity: O(1)Auxiliary Space: O(1)
inderDuMCA
Chandan_Kumar
Akanksha_Rai
SamyuktaSHegde
Code_Mech
SHUBHAMSINGH10
jana_sayantan
decode2207
amankr0211
Insertion Sort
Picked
School Programming
Sorting
Sorting
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Constructors in Java
Exceptions in Java
Python Exception Handling
Python Try Except
Ternary Operator in Python
Merge Sort
Bubble Sort Algorithm
QuickSort
Insertion Sort
Selection Sort Algorithm