JAVA PROGRAM Write a program that reads a series of input li

JAVA PROGRAM: Write a program that reads a series of input lines and sorts them into alphabetical order, ignoring the case of the words. The program should use the merge sort algorithm so that it efficiently sort even a large file. One progam where a file type can be inputted and another where you type in the modules.

Heres a link that the java program needs to alphabeticatize. The files has the first and last names of over 15 people.

https://expirebox.com/download/7980727966879aa0df6f91b5a8ceca8f.html

Solution

package com.java2novice.sorting;

public class MyMergeSort {

     

    private int[] array;

    private int[] tempMergArr;

    private int length;

    public static void main(String a[]){

         

        int[] inputArr = { };

        MyMergeSort mms = new MyMergeSort();

        mms.sort(inputArr);

        for(int i:inputArr){

            System.out.print(i);

            System.out.print(\" \");

        }

    }

     

    public void sort(int inputArr[]) {

        this.array = inputArr;

        this.length = inputArr.length;

        this.tempMergArr = new int[length];

        doMergeSort(0, length - 1);

    }

    private void doMergeSort(int lowerIndex, int higherIndex) {

         

        if (lowerIndex < higherIndex) {

            int middle = lowerIndex + (higherIndex - lowerIndex) / 2;

            // Below step sorts the left side of the array

            doMergeSort(lowerIndex, middle);

            // Below step sorts the right side of the array

            doMergeSort(middle + 1, higherIndex);

            // Now merge both sides

            mergeParts(lowerIndex, middle, higherIndex);

        }

    }

    private void mergeParts(int lowerIndex, int middle, int higherIndex) {

        for (int i = lowerIndex; i <= higherIndex; i++) {

            tempMergArr[i] = array[i];

        }

        int i = lowerIndex;

        int j = middle + 1;

        int k = lowerIndex;

        while (i <= middle && j <= higherIndex) {

            if (tempMergArr[i] <= tempMergArr[j]) {

                array[k] = tempMergArr[i];

                i++;

            } else {

                array[k] = tempMergArr[j];

                j++;

            }

            k++;

        }

        while (i <= middle) {

            array[k] = tempMergArr[i];

            k++;

            i++;

        }

    }

}

input:

Slater, Kendall
Lavery, Ryan
Chandler, Arabella \"Babe\"
Chandler, Stuart
Kane, Erica
Chandler, Adam Jr
Slater, Zach
Montgomery, Jackson
Chandler, Krystal
Martin, James
Montgomery, Bianca
Cortlandt, Palmer
Devane, Aidan
Madden, Josh
Hayward, David
Lavery,k Jonathan
Smythe, Greenlee
Cortlandt, Opal
McDermott, Annie
Henry, Di
Grey, Maria
English, Brooke
Keefer, Julia
Martin, Joseph
Montgomery, Lily
Dillon, Amanda
Colby, Liza
Stone, Mary Frances
Chandler, Colby
Frye, Derek
Montgomery, Reggie
Montgomery, Sean
Santos, Hayley
Santos, Mateo
Dillon, Janet
Jefferson, Kelsey
Chandler, Marian
Fargate, Myrtle
Henry, Del
Codahy, Livia
Warner, Anita
Lavery, Spike
Martin, Ruth
Montgomery, Barbara