Question

Design algorithm and program to work on the following data lists. Use at least 2 data structures/algorithms learnt in this course to get the following two outputs:

Output 1: Sort each data list.

Output 2: Pick the largest 3 numbers of each list to form a new list, and then sort the new list.

Data 1: 1, 5, 33, 57, 99, 26, 992

Data 2: 0, 33, 2234, 2, 902, 1, 5

Data 3: 5, 2, 22, 7, 99, 5, 17,92

Data 4: 100, 99876, 0, 899, 54, 88

(source code in java please with output ASAP)

Answer 1

Code Screenshots:

Main.java: // Import the // required packages. import java.util.*; // Define the // Main class. class Main { // Define the method sortByInsertion (). public static void sortByInsertion (int dataSet[]) { // Declare a variable to // store the current value. int currval; // Run the loop to // perform the insertion sort. for (int i = 1; i < dataSet.length; i++) { // Set the value at the index // i as the current value. currval = dataSet[i]; // Set the value of j as i-1 // to check all the indices // before i. int j = i - 1; // Run the loop till the value // of the variable jis greater // than 0 and the value at the // index j is greater than // the value present at the index i. while (j >= 0 && dataSet[j] > currval) { // Move the value at index j, // ahead by one place. dataSet(j + 1] dataSet[j]; j = j - 1; } // Put the current value // at the index j+1. dataSet [j + 1] = currval; } بها // Define the method sortByBubble() public static void sortByBubble (int dataSet[]) { // Run the loop to // perform the bubble sort. for (int i=0; i< dataSet.length - 1; i++) { Run the loop // to perform the swaps. for(int j=0; j < dataSet.length - i - l; j++) { // If the value at jth index // is greater than the value // present at the index j+1, // swap the values. if (dataSet[j] > dataSet[j+1]) { int temp = dataSet[j];

dataSet[j] = dataSet [j+1]; dataSet[j+1] = temp; } } // Define the main() method. public static void main(String[] args) { // Define 4 arrays to store the data lists. int datal[] = {1, 5, 33, 57, 99, 26, 992}; int data2[] = {0, 33, 2234, 2, 902, 1, 5}; int data3 [] {5, 2, 22, 7, 99, 5, 17,92}; int data4 [1] {100, 99876, 0, 899, 54, 88}; // Sort the first two data // lists using insertion sort. sortByInsertion (datal); sortByInsertion (data2); // Sort the other two data // sets using bubble sort. sortByBubble (data3); sortByBubble (data 4); // // Display the four data lists // after performing the sort. // System.out.print ("Data 1: "); for (int i=0; i<datal.length; i++) { System.out.print (datal[i] + " "); } System.out.println(); System.out.print ("Data 2: "); for (int i=0; i<data2.length; i++) { } System.out.print (data2 [i] + ""); System.out.println(); System.out.print("Data 3: "); for (int i=0; i<data3.length; i++) { } System.out.print (data[i] + " "); System.out.println(); System.out.print ("Data 4: "); for (int i=0; i<data4.length; i++) { System.out.print (data4 [i] + " "); } System.out.println(); // Define an array to // store the new list. int newDataSet[] = new int[12]; // Run the loop to store the

// last three elements from // each list into the new list. // Since the lists are sorted in // ascending order, the last three // elements are the greatest three // elements in each list. for (int i=0; i<12; i++) { if(i<3) { newDataSet[i] = datal [datal.length - (i + 1)]; } else if(i < 6) { newDataSet[i] = data2 [data2.length ((1/3) + 1)]; } else if (i < 9) { newDataSet[i] = data3 [data3.length ((i83) + 1)]; } else { newDataSet[i] = data4 [data4.length - ((i%3) + 1)]; } مه // Display the newly formed list. System.out.print ("New list: "); for(int i=0; i<newDataSet.length; i++) { System.out.print(newDataSet[i] + " "); } System.out.println(); // Sort the new list. sortByInsertion (newDataSet); // Display the new list // after performing the sort. System.out.print ("New list after Sorting: "); for(int i=0; i<newDataSet.length; i++) { } System.out.print(newDataSet[i] + " "); System.out.println(); }

Sample Output:

Data 1: 1 5 26 33 57 99 992 Data 2: 0 1 2 5 33 902 2234 Data 3: 2 5 5 7 17 22 92 99 Data 4: 054 88 100 899 99876 New list: 992 99 57 2234 902 33 99 92 22 99876 899 100 New list after Sorting: 22 33 57 92 99 99 100 899 902 992 2234 99876

Code to Copy:

Main.java:

// Import the

// required packages.

import java.util.*;

// Define the

// Main class.

class Main

{

    // Define the method sortByInsertion().

    public static void sortByInsertion(int dataSet[])

    {

        // Declare a variable to

        // store the current value.

        int currVal;

       

        // Run the loop to

        // perform the insertion sort.

        for (int i = 1; i < dataSet.length; i++)

        {

            // Set the value at the index

            // i as the current value.

            currVal = dataSet[i];

           

            // Set the value of j as i-1

            // to check all the indices

            // before i.

            int j = i - 1;

            // Run the loop till the value

            // of the variable j is greater

            // than 0 and the value at the

            // index j is greater than

            // the value present at the index i.

            while (j >= 0 && dataSet[j] > currVal)

            {

                // Move the value at index j,

                // ahead by one place.

                dataSet[j + 1] = dataSet[j];

                j = j - 1;

            }

            // Put the current value

            // at the index j+1.

            dataSet[j + 1] = currVal;

        }

    }

    // Define the method sortByBubble()

    public static void sortByBubble(int dataSet[])

    {

        // Run the loop to

        // perform the bubble sort.

        for(int i=0; i< dataSet.length - 1; i++)

        {

            // Run the loop

            // to perform the swaps.

            for(int j=0; j < dataSet.length - i - 1; j++)

            {

                // If the value at jth index

                // is greater than the value

                // present at the index j+1,

                // swap the values.

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

                {

                    int temp = dataSet[j];

                    dataSet[j] = dataSet[j+1];

                    dataSet[j+1] = temp;

                }

            }

        }

    }

    // Define the main() method.

    public static void main(String[] args)

    {

        // Define 4 arrays to store the data lists.

        int data1[] = {1, 5, 33, 57, 99, 26, 992};

        int data2[] = {0, 33, 2234, 2, 902, 1, 5};

        int data3[] = {5, 2, 22, 7, 99, 5, 17,92};

        int data4[] = {100, 99876, 0, 899, 54, 88};

        // Sort the first two data

        // lists using insertion sort.

        sortByInsertion(data1);

        sortByInsertion(data2);

       

        // Sort the other two data

        // sets using bubble sort.

        sortByBubble(data3);

        sortByBubble(data4);

        //

        // Display the four data lists

        // after performing the sort.

        //

        System.out.print("Data 1: ");

        for(int i=0; i<data1.length; i++)

        {

            System.out.print(data1[i] + " ");

        }

        System.out.println();

        System.out.print("Data 2: ");

        for(int i=0; i<data2.length; i++)

        {

            System.out.print(data2[i] + " ");

        }

        System.out.println();

        System.out.print("Data 3: ");

        for(int i=0; i<data3.length; i++)

        {

            System.out.print(data3[i] + " ");

        }

        System.out.println();

        System.out.print("Data 4: ");

        for(int i=0; i<data4.length; i++)

        {

            System.out.print(data4[i] + " ");

        }

        System.out.println();

        // Define an array to

        // store the new list.

        int newDataSet[] = new int[12];

        // Run the loop to store the

        // last three elements from

        // each list into the new list.

        // Since the lists are sorted in

        // ascending order, the last three

        // elements are the greatest three

        // elements in each list.

        for(int i=0; i<12; i++)

        {

            if(i<3)

            {

                newDataSet[i] = data1[data1.length - (i + 1)];

            }

            else if(i < 6)

            {

                newDataSet[i] = data2[data2.length - ((i%3) + 1)];

            }

            else if(i < 9)

            {

                newDataSet[i] = data3[data3.length - ((i%3) + 1)];

            }

            else

            {

                newDataSet[i] = data4[data4.length - ((i%3) + 1)];

            }

        }

        // Display the newly formed list.

        System.out.print("New list: ");

        for(int i=0; i<newDataSet.length; i++)

        {

            System.out.print(newDataSet[i] + " ");

        }

        System.out.println();

        // Sort the new list.

        sortByInsertion(newDataSet);

        // Display the new list

        // after performing the sort.

        System.out.print("New list after Sorting: ");

        for(int i=0; i<newDataSet.length; i++)

        {

            System.out.print(newDataSet[i] + " ");

        }

        System.out.println();

    }

}