Data Base Structures

Make some modifications to the java code below that either makes the code more efficient or replace some lines of code with alternative way to get the same outcome. Please do not change the integers “64, 34, 25, 12, 22, 11, 90” as that does not count as an actual modification and these integers are needed.

// Java program for implementation of Bubble Sort

class BubbleSort

{

void bubbleSort(int arr[])

{

int n = arr.length;

for (int i = 0; i

for (int j = 0; j

if (arr[j] > arr[j+1])

{

// swap temp and arr[i]

int temp = arr[j];

arr[j] = arr[j+1];

arr[j+1] = temp;

}

}

/* Prints the array */

void printArray(int arr[])

{

int n = arr.length;

for (int i=0; i

System.out.print(arr[i] + ” “);

System.out.println();

}

// Driver method to test above

public static void main(String args[])

{

BubbleSort ob = new BubbleSort();

int arr[] = {64, 34, 25, 12, 22, 11, 90};

ob.bubbleSort(arr);

System.out.println(“Sorted array”);

ob.printArray(arr);

}

}