Need help on this- See screenshoots and bolded line below public class PartitionInsertionapp { public static void main(String[] args) { final String BLANKS = " "; // A String of two blanks int i, pivot, partition; // Array index // The array to be sorted int[] data = { 100, 80, 23, 50, 88, 70, 60, 90, 20, 72, 40, 8, 9 }; PartitionInsertionapp part = new PartitionInsertionapp(); Insertion is = new Insertion(); // Print the array before sorting: System.out.println("Here is the entire original array:"); for (i = 0; i < data.length; i++) System.out.print(data[i] + BLANKS); System.out.println(); // Calculate the pivot using median-of-three partitioning int left = 0; int right = data.length - 1; int center = (left + right) / 2; // Sort left, center, and right elements and use center as pivot if (data[center] < data[left]) { swap(data, left, center); } if (data[right] < data[left]) { swap(data, left, right); } if (data[right] < data[center]) { swap(data, center, right); } pivot = data[center]; // Call the partition method to partition the array around the pivot partition = part.partitionIt(0, data.length - 1, pivot, data); // Display the pivot and the index where the upper partition begins System.out.println("The pivot value is " + pivot + " and the upper partition starts at index " + partition); // Display the partitioned array System.out.println("Here is the partitioned array:"); for (i = 0; i < data.length; i++) System.out.print(data[i] + BLANKS); System.out.println(); // Sort the lower partition using insertion sort is.insertionSort(0, partition - 1, data); // Display the array after sorting the lower partition System.out.println("Here is the array after sorting the lower partition:"); for (i = 0; i < data.length; i++) System.out.print(data[i] + BLANKS); System.out.println(); // Sort the upper partition using insertion sort is.insertionSort(partition, data.length - 1, data); // Display the final sorted array System.out.println("Here is the final sorted array:"); for (i = 0; i < data.length; i++) System.out.print(data[i] + BLANKS); System.out.println(); } // Helper method to swap two elements in an array private static void swap(int[] arr, int i, int j) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } } PartitionInsertionapp part = new PartitionInsertionapp (); Insertion is = new Insertion(); // Call the partition method to partition the array around the pivot partition = part.partitionIt (0, data.length - 1, pivot, data);.

1. Need help on this- See screenshoots and bolded line below
public class PartitionInsertionapp {
public static void main(String[] args) {
final String BLANKS = " "; // A String of two blanks
int i, pivot, partition; // Array index
// The array to be sorted
int[] data = { 100, 80, 23, 50, 88, 70, 60, 90, 20, 72, 40, 8, 9 };
PartitionInsertionapp part = new PartitionInsertionapp();
Insertion is = new Insertion();
// Print the array before sorting:
System.out.println("Here is the entire original array:");
for (i = 0; i < data.length; i++)
System.out.print(data[i] + BLANKS);
System.out.println();
// Calculate the pivot using median-of-three partitioning
int left = 0;
int right = data.length - 1;
int center = (left + right) / 2;
// Sort left, center, and right elements and use center as pivot
if (data[center] < data[left]) {
swap(data, left, center);
}
if (data[right] < data[left]) {
swap(data, left, right);
}
if (data[right] < data[center]) {
swap(data, center, right);
}
pivot = data[center];
// Call the partition method to partition the array around the pivot
partition = part.partitionIt(0, data.length - 1, pivot, data);
// Display the pivot and the index where the upper partition begins
System.out.println("The pivot value is " + pivot + " and the upper partition starts at index " +
partition);

2. // Display the partitioned array
System.out.println("Here is the partitioned array:");
for (i = 0; i < data.length; i++)
System.out.print(data[i] + BLANKS);
System.out.println();
// Sort the lower partition using insertion sort
is.insertionSort(0, partition - 1, data);
// Display the array after sorting the lower partition
System.out.println("Here is the array after sorting the lower partition:");
for (i = 0; i < data.length; i++)
System.out.print(data[i] + BLANKS);
System.out.println();
// Sort the upper partition using insertion sort
is.insertionSort(partition, data.length - 1, data);
// Display the final sorted array
System.out.println("Here is the final sorted array:");
for (i = 0; i < data.length; i++)
System.out.print(data[i] + BLANKS);
System.out.println();
}
// Helper method to swap two elements in an array
private static void swap(int[] arr, int i, int j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
PartitionInsertionapp part = new PartitionInsertionapp (); Insertion is = new Insertion();
// Call the partition method to partition the array around the pivot partition = part.partitionIt (0,
data.length - 1, pivot, data);