We are using the tempValue variable to temporarily store the value of one number.

įor an element pointed by the outer loop, if any smaller element is found by the inner loop, it swaps these elements.

The inner one will run from the current element pointed by the outer loop to the last element of the array i.e., for each element, the inner loop will iterate over all the elements to its right.

The outer loop runs from the first element to the last element of the array.

We are using two for loops to sort the array.

This is the main step used for sorting the array. It prints the array content before sorting is started. It takes the values as inputs from the user and adds them to the array. It uses a for loop to read the array values. The size of the array is equal to the user input size. Read it and assign it to the variable size. Īsk the user to enter the size of the array.

Also, declare one integer variable tempValue to use as a temp variable. Sorting a list in Java using the Comparator interface methods The list interface in Java is the most used, and it is implemented by classes like ArrayList, LinkedList, Stack, and Vector. All Implemented Interfaces: Serializable, Cloneable, Iterable , Collection , List , RandomAccess Direct Known Subclasses: AttributeList, RoleList, RoleUnresolvedList public class ArrayList extends AbstractList implements List , RandomAccess, Cloneable, Serializable Resizable-array implementation of the List interface.

Initialize one Scanner variable sc to read the user input. The commented numbers in the above program denote the step numbers below :

Java array sort