demonstrate to you how the insertion sort works. Type up the code and submit the output only. CODE: import java.util.Arrays; public class InsertionSort { public static void main(String[] args) { int[] someNums = {90, 85, 65, 95, 75 }; int a = 1, b = 0; int temp; System.out.println("The int array starts as: " + "\n"+Arrays.toString(someNums) + "\n"); while (a < someNums.length) { temp = someNums[a];
This lab will demonstrate to you how the insertion sort works. Type up the code and
submit the output only.
CODE:
import java.util.Arrays;
public class InsertionSort {
public static void main(String[] args) {
int[] someNums = {90, 85, 65, 95, 75 };
int a = 1, b = 0;
int temp;
System.out.println("The int array starts as: " + "\n"+Arrays.toString(someNums) + "\n");
while (a < someNums.length)
{
temp = someNums[a];
System.out.println("Analyze the " + a + " position in the array, and the temp value
is " + temp + "\n");
b = a - 1;
while (b >= 0 && someNums[b] > temp)
{
someNums[b + 1] = someNums[b];
b--;
System.out.println( Arrays.toString(someNums) + " temp is: " + temp);
}
System.out.println("Inserting the value " + temp + " into the " + (b+1) + " position
in the array");
someNums[b + 1] = temp;
a++;
System.out.println( Arrays.toString(someNums) + "\n");
}
System.out.println("\nThe int array ends as: " + "\n"+Arrays.toString(someNums));
}
Step by step
Solved in 4 steps with 1 images
