Sort Java Array Elements in Ascending Order

To sort an array in Java, you need to compare each element of the array to all the remaining elements and verify whether it is greater if so swap them.

One solution to do so you need to use two loops (nested) where the inner loop starts with i+1 (where i is the variable of outer loop) to avoid repetitions in comparison.

Example

import java.util.Arrays;
import java.util.Scanner;

public class ArrayInOrder {
   public static void main(String args[]) {
      Scanner sc = new Scanner(System.in);
      System.out.println("Enter the size of the array that is to be created::");
      int size = sc.nextInt();
      int[] myArray = new int[size];
      System.out.println("Enter the elements of the array ::");
   
      for(int i = 0; i<size; i++) {
         myArray[i] = sc.nextInt();
      }

      for(int i = 0; i<size-1; i++) {
         for (int j = i+1; j<myArray.length; j++) {
            if(myArray[i] > myArray[j]) {
               int temp = myArray[i];
               myArray[i] = myArray[j];
               myArray[j] = temp;
            }
         }
      }
      System.out.println(Arrays.toString(myArray));
   }
}

Output

You can also sort an array using the sort() method of the Arrays class.

int[] myArray = {12, 56, 78, 90, 123, 75, 897};
Arrays.sort(myArray);
System.out.println(Arrays.toString(myArray));