Question

Java

We will look at the behavior of three different sorts on randomly generated lists of different sizes The three sorts are bubblesort, insertion sort, and quicksort. Randomly generate integers in the range 0-99 for your random numbers. You may choose your own random number generation technique (this is an exception to the no-outside-help requirement for this assignment. You must document the source of your random number generation in the code. ° Here is what your code should do: 1. Do this 10 times: a. b. c. Generate a random list of 10 items Have each algorithm sort the list. Give the original list, the sorted list, and the number of comparisons done by each algorithm 2. Do this 10 times: a. b. c. Generate a random list of 100 items Have each algorithm sort the list. Give the original list, the sorted list, and the number of comparisons done by each algorithm 3. Do this 10 times: a. b. c. Generate a random list of 1000 items Have each algorithm sort the list. Give the original list, the sorted list, and the number of comparisons done by each algorithm 4. At the end: For each algorithm and each list length give the average of the number of comparisons a.

Answer 1

import java.util.Random;

public class SortingsDemo {

    static int quickSortComaprsions = 0;
    static int bubbleSortComaprison = 0;
    static int insertionSortComparsion = 0;

    public static void main(String[] args) {
        runSort(10);
        runSort(100);
        runSort(1000);
    }

    static void runSort(int no) {
        for (int i=0;i<no;i++) {
            int arr[] = new int[no];
            int arr2[] = new int[no];
            int arr3[] = new int[no];

            System.out.println("----------------------------------------------------------------------------------------");
            fillArry(arr,no);
            fillArry(arr2,no);
            fillArry(arr3,no);
            bubbleSort(arr);
            insertionSort(arr2);
            intializeQuickSort(arr3);
        }
    }

    private static void intializeQuickSort(int[] arr) {
        System.out.println();
        System.out.println("quickSort sort");
        System.out.println("Original list::");
        quickSortComaprsions = 0;
        quicksort(arr,0,arr.length-1);
        printArray(arr);
        System.out.println("No of comparsions::"+quickSortComaprsions);
        System.out.println("Sorted list");
        printArray(arr);
        System.out.println();
    }

    static void fillArry(int arr[], int no) {
        Random r = new Random();

        for (int i = 0; i < no; i++) {
            arr[i] = r.nextInt(99 + 1);
        }
    }

    static void printArray(int arr[]) {
        int length = arr.length;
        for (int index = 0; index < length; ++index)
            System.out.print(arr[index] + " ");

        System.out.println();
    }

    static void bubbleSort(int arr[]) {
        System.out.println();
        System.out.println("Bubble sort");
        System.out.println("Original list::");
        bubbleSortComaprison = 0;
        printArray(arr);
        int length = arr.length;
        for (int index = 1; index < length; ++index) {
            int key = arr[index];
            int innerIndex = index - 1;
            while (innerIndex >= 0 && arr[innerIndex] > key) {
                bubbleSortComaprison++;
                arr[innerIndex + 1] = arr[innerIndex];
                innerIndex = innerIndex - 1;
            }
            arr[innerIndex + 1] = key;
        }
        System.out.println("No Of Comparsions::" + bubbleSortComaprison);
        System.out.println("Sorted List");
        printArray(arr);
        System.out.println();
    }

    static void insertionSort(int arr[]) {
        System.out.println();
        System.out.println("insertionSort sort");
        System.out.println("Original list::");
        printArray(arr);
        insertionSortComparsion = 0;
        int length = arr.length;
        for (int index = 1; index < length; ++index) {
            int key = arr[index];
            int keyCompareIndex = index - 1;
            while (keyCompareIndex >= 0 && arr[keyCompareIndex] > key) {
                insertionSortComparsion++;
                arr[keyCompareIndex + 1] = arr[keyCompareIndex];
                keyCompareIndex = keyCompareIndex - 1;
            }
            arr[keyCompareIndex + 1] = key;
        }
        System.out.println("No Of Comparsions::" + insertionSortComparsion);
        System.out.println("Sorted List");
        printArray(arr);
        System.out.println();

    }

    static int partition(int arr[], int low, int high) {
        int pivot = arr[high];
        int index = (low - 1);
        for (int innerIndex = low; innerIndex < high; innerIndex++) {
            if (arr[innerIndex] <= pivot) {
                quickSortComaprsions++;
                index++;
                int temp = arr[index];
                arr[index] = arr[innerIndex];
                arr[innerIndex] = temp;
            }
        }
        int temp = arr[index + 1];
        arr[index + 1] = arr[high];
        arr[high] = temp;

        return index + 1;
    }

    static void quicksort(int arr[], int low, int high) {
        if (low < high) {
            int pi = partition(arr, low, high);
            quicksort(arr, low, pi - 1);
            quicksort(arr, pi + 1, high);
        }
    }


}