Question

JAVA plz

Program 0 (50%): Why – just why? One of the least useful sorts that professors never like to talk about (because it’s SOOO inefficient and never used in practice) has two phases: 1) it shuffles the numbers in the array and 2) checks to see if they are in ascending order. Why is this so bad? Because there are n! ways to order an array with n elements. For example, if there are 100 elements in the array, n == 100 and there are 100*99*98*97*…*5*4*3*2*1 different ways to arrange that! Ridiculous? Yes. That’s why you’re going to code it up. How do you shuffle an array? The easiest way is to traverse each element in the array with a loop, then pick a random element/cell to swap it with. For this assignment, you need to design (pseudocode) a program that 1) initializes and array of 5 elements with random values between 1-50 (i.e. no user input), 2) shuffles the array, 3) prints the array, 4) determines if the elements are in ascending (or non-decreasing) order and 5) repeats steps 2-4 until step 4 is true. Below is an edited sample output, only showing the last few lines of output. Hint: stay sane and use functions. Also, since you need to be able to visualize what’s going on, we’d recommend starting with printing the array to the screen. Note: the random number generator below

Sample run 1:

|34|44|28|33|29|

|33|28|29|34|44|

|34|29|44|33|28|

|33|44|28|34|29|

|34|28|29|33|44|

|33|29|44|34|28

| |34|44|28|33|29|

|33|28|29|34|44|

|34|29|44|33|28|

|33|44|28|34|29|

|34|28|29|33|44|

|33|29|44|34|28|

|34|44|28|33|29|

|33|28|29|34|44|

|34|29|44|33|28|

|33|44|28|34|29|

|34|28|29|33|44|

|33|29|44|34|28|

|34|44|28|33|29|

|33|28|29|34|44|

|34|29|44|33|28|

|33|29|28|44|34|

|44|29|34|28|33|

|28|29|33|34|44|

Answer 1

Here is the completed code for this problem. Comments are included, go through it, learn how things work and let me know if you have any doubts or if you need anything to change. If you are satisfied with the solution, please rate the answer. Thanks

// LazySort.java

public class LazySort {

      // method to check if an array is sorted (in asc order)

      static boolean isSorted(int arr[]) {

            // looping from index 1 to length-1

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

                  // if previous element is bigger than current element, array is not

                  // in sorted order, returning false

                  if (arr[i - 1] > arr[i]) {

                        return false;

                  }

            }

            // if all numbers are in sorted order, returning true

            return true;

      }

      // method to print elements of an array

      static void printArray(int arr[]) {

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

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

            }

            System.out.println("|");

      }

      // method to shuffle elements of an array

      static void shuffle(int arr[]) {

            // looping for array's length number of times

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

                  // generating a random valid index between 0 and length-1

                  int randIndex = (int) (Math.random() * arr.length);

                  // swapping elements at indices randomIndex and i

                  int temp = arr[randIndex];

                  arr[randIndex] = arr[i];

                  arr[i] = temp;

            }

      }

      public static void main(String[] args) {

            // creating an array of 5 integers, and filling the values

            int arr[] = new int[5];

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

                  // generating and assigning integer between 1 and 50 to current

                  // location

                  arr[i] = (int) (Math.random() * 50) + 1;

            }

            // printing array

            printArray(arr);

            // looping until the array is in sorted order

            while (!isSorted(arr)) {

                  // shuffling array

                  shuffle(arr);

                  // printing array

                  printArray(arr);

            }

      }

}

/*OUTPUT*/

|9|35|48|37|32|

|9|37|48|35|32|

|48|32|9|37|35|

|37|32|35|9|48|

|9|32|37|48|35|

|48|37|9|35|32|

|32|37|48|9|35|

|9|48|32|37|35|

|48|35|37|9|32|

|37|9|48|32|35|

|37|48|32|9|35|

|37|32|9|35|48|

|32|9|35|48|37|

|35|32|9|37|48|

|37|32|9|35|48|

|32|48|37|9|35|

|48|37|9|32|35|

|9|35|37|48|32|

|37|32|48|35|9|

|48|32|9|37|35|

|35|32|37|48|9|

|9|35|48|32|37|

|32|35|9|37|48|

|32|48|37|35|9|

|37|35|32|48|9|

|9|48|37|32|35|

|48|32|9|35|37|

|48|35|9|37|32|

|48|9|37|32|35|

|37|48|9|32|35|

|9|37|48|35|32|

|35|32|37|9|48|

|32|48|9|35|37|

|32|48|9|35|37|

|37|35|9|48|32|

|35|48|32|37|9|

|32|9|35|37|48|

|9|32|37|48|35|

|32|35|9|48|37|

|32|9|35|48|37|

|9|32|48|37|35|

|9|48|32|35|37|

|48|35|37|32|9|

|48|35|32|37|9|

|35|32|9|48|37|

|48|37|35|32|9|

|32|48|35|37|9|

|32|48|37|35|9|

|9|32|35|37|48|