The document provides a Java code sample that implements an insertion sort algorithm to sort 100 random numbers in an array. The code generates random numbers between 0-99 to populate an array, then calls the insertion sort method which iterates through the array and inserts each element into the correctly sorted position. Finally it prints the array before and after sorting to show the results.

1. In java, Create an insertion sort algorithm that will accept 100 random values in an array, print
the sorted values in the console.
Solution
Answer:
The java code for an insertion sort algorithm that will accept 100 random values in an
array is given as below :
import java.util.*;
class InsertionSortApplication {
public static void main(String[] args) {
int A[] = new int[10];
allotArray(A);
System.out.println("The numbers previously sorting the array is : ");
arrayShow(A);
InsertionSortApplication(A);
System.out.println("The numbers after sorting the array is : ");
arrayShow(A);
}
private static void InsertionSortApplication(int[] arr) {
for (int i = 1; i < arr.length; i++) {
int readvalue = arr[i];
int j = i;
while (j > 0 && arr[j - 1] > readvalue) {
arr[j] = arr[j - 1];
j--;
}
arr[j] = readvalue;

2. }
}
public static void arrayShow(int[] B) {
System.out.println(Arrays.toString(B));
}
public static void allotArray(int[] B) {
for (int i = 0; i < B.length; i++) {
B[i] = (int) (Math.random() * 100);
}
}
}