insertion sort descending order java code example
Example 1: Insertion sort java 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));
}
}
Example 2: insertion sort java
Insertion program
public class InsertionSortExample
{
public void sort(int[] arrNum)
{
int number = arrNum.length;
for(int a = 1; a < number; ++a)
{
int keyValue = arrNum[a];
int b = a - 1;
while(b >= 0 && arrNum[b] > keyValue)
{
arrNum[b + 1] = arrNum[b];
b = b - 1;
}
arrNum[b + 1] = keyValue;
}
}
static void displayArray(int[] arrNum)
{
int num = arrNum.length;
for(int a = 0; a < num; ++a)
{
System.out.print(arrNum[a] + " ");
}
System.out.println();
}
public static void main(String[] args)
{
int[] arrInput = { 50, 80, 10, 30, 90, 60 };
InsertionSortExample obj = new InsertionSortExample();
obj.sort(arrInput);
displayArray(arrInput);
}
}