Create a program java then copy the following implementation of this mystery sort to your program:public static void mysterySort(int[] arr){ for(int i=0; i<arr.length; i++){ for(int k=0; k<arr.length-i-1; k++){ if(arr[k]>arr[k+1]){ //swap int hold=arr[k+1]; arr[k+1]=arr[k]; arr[k]=hold; } } }}public static Boolean isSorted(int[] arr){ for(int i=1; i<arr.length; i++){ if(arr[i] < arr[i-1]) return false; } return true;}Your main method accepts a number N from the command argument list. Then use the number N to create N-element int array.Assign random numbers between [0, Integer.MAX_VALUE) to each of the N elements of the array.Call isSorted method to test if the array is sorted in ascending order. Print the array elements.Call mysterySort method to sort the array.Call isSorted method again to verify the array was sorted successfully. Print the array elements.Once completed, test your program with different numbers of N and screenshot your result .Please include the following in the Word document you created for the assignment for the final submission: Answer this question: What kind of sort is this mystery sort? What is the average Big O for this sort?Copy/paste your completed code in MysterySort.javaInsert at least one screenshot of the running output in #7 above

The MysterySort method actually uses bubble sort algorithm, but not so efficient sorting algorithm.…

Answered: Create a program java then copy the…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Create a program java then copy the following implementation of this mystery sort to your program:

public static void mysterySort(int[] arr){
   for(int i=0; i<arr.length; i++){
    for(int k=0; k<arr.length-i-1; k++){
   if(arr[k]>arr[k+1]){ //swap
    int hold=arr[k+1];
    arr[k+1]=arr[k];
    arr[k]=hold;
   }
    }
   }
}

public static Boolean isSorted(int[] arr){
    for(int i=1; i<arr.length; i++){
   if(arr[i] < arr[i-1])
    return false;
    }
    return true;
}

Your main method accepts a number N from the command argument list. Then use the number N to create N-element int array.
Assign random numbers between [0, Integer.MAX_VALUE) to each of the N elements of the array.
Call isSorted method to test if the array is sorted in ascending order. Print the array elements.
Call mysterySort method to sort the array.
Call isSorted method again to verify the array was sorted successfully. Print the array elements.
Once completed, test your program with different numbers of N and screenshot your result .
Please include the following in the Word document you created for the assignment for the final submission:
- Answer this question: What kind of sort is this mystery sort? What is the average Big O for this sort?
- Copy/paste your completed code in MysterySort.java
- Insert at least one screenshot of the running output in #7 above

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions