Let’s learn insertion sort java descending order.
Insertion sort java descending order
Now let’s learn to sort numbers in reverse order or in descending order.
import java.util.Arrays; public class InsertionSortDescendingOrder { public static void main(String[] args) { int[] arrInput = { 50, 80, 10, 30, 90, 60 }; System.out.println("Before Sorting: "); displayArray(arrInput); insertionSort(arrInput); System.out.println("\nAfter Sorting: "); displayArray(arrInput); } private static void insertionSort(int[] arrNumber) { for(int a = 1; a < arrNumber.length; a++) { int toSort = arrNumber[a]; int b = a; while(b > 0 && arrNumber[b - 1] < toSort) { arrNumber[b] = arrNumber[b - 1]; b--; } arrNumber[b] = toSort; } } public static void displayArray(int[] arrPrint) { System.out.println(Arrays.toString(arrPrint)); } }
Output:
Before Sorting:
[50, 80, 10, 30, 90, 60]
After Sorting:
[90, 80, 60, 50, 30, 10]
Also read – garbage collection in java