Question

In JAVA please (need answers in a few hours!)

Exercise #2: Design and implement a program (name it SimpleSort) to implement and test the three sort algorithms (Bubble, Insertion, Selection) discussed in the lecture slides.

Define method BubbleSort() to implement Bubble sort of an array of integers. Modify the algorithm implementation to count number of swaps it takes to sort the array.

Define method InsertionSort() to implement insertion sort of an array of integers. Modify the algorithm implementation to count number of swaps it takes to sort the array.

Define method SelectionSort() to implement selection sort of an array of integers. Modify the algorithm implementation to count number of swaps it takes to sort the array.

Now, develop a test method that generates 50 integer values between 0 and 100, store them in an array, and then pass the array to those three sort methods. Document your code and organized your outputs as follows:

Arrays Values:

Bubble Sorted values:

Bubble Sort Swaps:

Insertion Sorted values:

Insertion Sort Swaps:

Selection Sorted values:

Selection Sort Swaps:

Answer 1

CODE IN JAVA:

SimpleSort.java file:

public class SimpleSort{
   public static int bubbleSort(int arr[]) {
       int n = arr.length;
       int swaps = 0;
       for (int i = 0; i < n; i++) {
           for (int j = 0; j < n - 1; j++) {
               if (arr[j] > arr[j + 1]) {
                   int temp = arr[j];
                   arr[j] = arr[j + 1];
                   arr[j + 1] = temp;
                   swaps += 1;
               }
           }
       }
       return swaps;
   }

   public static int insertionSort(int arr[]) {
       int n = arr.length;
       int swaps = 0;
       for (int i = 1; i < n; ++i) {
           int key = arr[i];
           int j = i - 1;
           while (j >= 0 && arr[j] > key) {
               arr[j + 1] = arr[j];
               j = j - 1;
               swaps += 1;
           }
           arr[j + 1] = key;
       }
       return swaps;
   }

   public static int selectionSort(int arr[]) {
       int n = arr.length;
       int swaps = 0;

       for (int i = 0; i < n - 1; i++) {
           int minInd = i;
           for (int j = i + 1; j < n; j++)
               if (arr[j] < arr[minInd])
                   minInd = j;
           int temp = arr[minInd];
           arr[minInd] = arr[i];
           arr[i] = temp;
           swaps += 1;
       }
       return swaps;
   }

   public static void main(String[] args) {
       int arr[] = { 12, 34, 65, 98, 32, 45, 12, 8, 4, 1, 47 };
       System.out.print("Array values:");
       for (int val : arr)
           System.out.print(val + " ");
       System.out.println("");
       int count = bubbleSort(arr);
       System.out.print("Bubble sorted values:");
       for (int val : arr)
           System.out.print(val + " ");
       System.out.println("");
       System.out.println("Bubble sort swaps:" + count);
       int arr1[] = { 12, 34, 65, 98, 32, 45, 12, 8, 4, 1, 47 };
       System.out.print("Array values:");
       for (int val : arr1)
           System.out.print(val + " ");
       System.out.println("");
       count = insertionSort(arr1);
       System.out.print("Insertion sorted values:");
       for (int val : arr1)
           System.out.print(val + " ");
       System.out.println("");
       System.out.println("Insertion sort swaps:" + count);
       int arr2[] = { 12, 34, 65, 98, 32, 45, 12, 8, 4, 1, 47 };
       System.out.print("Array values:");
       for (int val : arr2)
           System.out.print(val + " ");
       System.out.println("");
       count = selectionSort(arr2);
       System.out.print("Selection sorted values:");
       for (int val : arr2)
           System.out.print(val + " ");
       System.out.println("");
       System.out.println("Selection sort swaps:" + count);
   }

}

OUTPUT: