JAVA PROGRAM ASAP *********** THIS PROGRAM MUST WORK IN HYPERGRADE AND PASS ALL THE TEST CASES. Please create a program BECAUSE IT IS. MY HOMEWORK ASSIGNMENT with the following parts which are down below: The left index is inclusive and the right index is exclusive. 1. public static void bubbleSort(int[] array, int left, int right) { // your code here } 2. public static void insertionSort(int[] array, int left, int right) { // your code here } 3. public static void selectionSort(int[] array, int left, int right) { // your code here } Test Case 1 Please enter a space separated list of numbers to sort or type QUIT to exit:\n 4 3 2 1ENTER Sorting first half of the array using Bubble Sort algorithm:\n 3 4 2 1\n Sorting second half of the array using Bubble Sort algorithm:\n 4 3 1 2\n Sorting the array using Bubble Sort algorithm:\n 1 2 3 4\n Sorting first half of the array using Insertion Sort algorithm:\n 3 4 2 1\n Sorting second half of the array using Insertion Sort algorithm:\n 4 3 1 2\n Sorting the array using Insertion Sort algorithm:\n 1 2 3 4\n Sorting first half of the array using Selection Sort algorithm:\n 3 4 2 1\n Sorting second half of the array using Selection Sort algorithm:\n 4 3 1 2\n Sorting the array using Selection Sort algorithm:\n 1 2 3 4\n Please enter a space separated list of numbers to sort or type QUIT to exit:\n quitENTER Test Case 2 Please enter a space separated list of numbers to sort or type QUIT to exit:\n -1 -2 -3 -4ENTER Sorting first half of the array using Bubble Sort algorithm:\n -2 -1 -3 -4\n Sorting second half of the array using Bubble Sort algorithm:\n -1 -2 -4 -3\n Sorting the array using Bubble Sort algorithm:\n -4 -3 -2 -1\n Sorting first half of the array using Insertion Sort algorithm:\n -2 -1 -3 -4\n Sorting second half of the array using Insertion Sort algorithm:\n -1 -2 -4 -3\n Sorting the array using Insertion Sort algorithm:\n -4 -3 -2 -1\n Sorting first half of the array using Selection Sort algorithm:\n -2 -1 -3 -4\n Sorting second half of the array using Selection Sort algorithm:\n -1 -2 -4 -3\n Sorting the array using Selection Sort algorithm:\n -4 -3 -2 -1\n Please enter a space separated list of numbers to sort or type QUIT to exit:\n quitENTER Test Case 3 Please enter a space separated list of numbers to sort or type QUIT to exit:\n QuitENTER Test Case 4 Please enter a space separated list of numbers to sort or type QUIT to exit:\n 0ENTER Sorting first half of the array using Bubble Sort algorithm:\n 0\n Sorting second half of the array using Bubble Sort algorithm:\n 0\n Sorting the array using Bubble Sort algorithm:\n 0\n Sorting first half of the array using Insertion Sort algorithm:\n 0\n Sorting second half of the array using Insertion Sort algorithm:\n 0\n Sorting the array using Insertion Sort algorithm:\n 0\n Sorting first half of the array using Selection Sort algorithm:\n 0\n Sorting second half of the array using Selection Sort algorithm:\n 0\n Sorting the array using Selection Sort algorithm:\n 0\n Please enter a space separated list of numbers to sort or type QUIT to exit:\n qUitENTER Test Case 5 Please enter a space separated list of numbers to sort or type QUIT to exit:\n 1 2 3 10 9 7 8 9 9 9 9 9 1 1 1 1 2 2 2 2 10 10 10 7 7 7 -100ENTER Sorting first half of the array using Bubble Sort algorithm:\n 1 1 2 3 7 8 9 9 9 9 9 9 10 1 1 1 2 2 2 2 10 10 10 7 7 7 -100\n Sorting second half of the array using Bubble Sort algorithm:\n 1 2 3 10 9 7 8 9 9 9 9 9 1 -100 1 1 1 2 2 2 2 7 7 7 10 10 10\n Sorting the array using Bubble Sort algorithm:\n -100 1 1 1 1 1 2 2 2 2 2 3 7 7 7 7 8 9 9 9 9 9 9 10 10 10 10\n Sorting first half of the array using Insertion Sort algorithm:\n 1 1 2 3 7 8 9 9 9 9 9 9 10 1 1 1 2 2 2 2 10 10 10 7 7 7 -100\n Sorting second half of the array using Insertion Sort algorithm:\n 1 2 3 10 9 7 8 9 9 9 9 9 1 -100 1 1 1 2 2 2 2 7 7 7 10 10 10\n Sorting the array using Insertion Sort algorithm:\n -100 1 1 1 1 1 2 2 2 2 2 3 7 7 7 7 8 9 9 9 9 9 9 10 10 10 10\n Sorting first half of the array using Selection Sort algorithm:\n 1 1 2 3 7 8 9 9 9 9 9 9 10 1 1 1 2 2 2 2 10 10 10 7 7 7 -100\n Sorting second half of the array using Selection Sort algorithm:\n 1 2 3 10 9 7 8 9 9 9 9 9 1 -100 1 1 1 2 2 2 2 7 7 7 10 10 10\n Sorting the array using Selection Sort algorithm:\n -100 1 1 1 1 1 2 2 2 2 2 3 7 7 7 7 8 9 9 9 9 9 9 10 10 10 10\n Please enter a space separated list of numbers to sort or type QUIT to exit:\n QUITENTER
JAVA PROGRAM ASAP *********** THIS PROGRAM MUST WORK IN HYPERGRADE AND PASS ALL THE TEST CASES. Please create a program BECAUSE IT IS. MY HOMEWORK ASSIGNMENT with the following parts which are down below: The left index is inclusive and the right index is exclusive. 1. public static void bubbleSort(int[] array, int left, int right) { // your code here } 2. public static void insertionSort(int[] array, int left, int right) { // your code here } 3. public static void selectionSort(int[] array, int left, int right) { // your code here } Test Case 1 Please enter a space separated list of numbers to sort or type QUIT to exit:\n 4 3 2 1ENTER Sorting first half of the array using Bubble Sort algorithm:\n 3 4 2 1\n Sorting second half of the array using Bubble Sort algorithm:\n 4 3 1 2\n Sorting the array using Bubble Sort algorithm:\n 1 2 3 4\n Sorting first half of the array using Insertion Sort algorithm:\n 3 4 2 1\n Sorting second half of the array using Insertion Sort algorithm:\n 4 3 1 2\n Sorting the array using Insertion Sort algorithm:\n 1 2 3 4\n Sorting first half of the array using Selection Sort algorithm:\n 3 4 2 1\n Sorting second half of the array using Selection Sort algorithm:\n 4 3 1 2\n Sorting the array using Selection Sort algorithm:\n 1 2 3 4\n Please enter a space separated list of numbers to sort or type QUIT to exit:\n quitENTER Test Case 2 Please enter a space separated list of numbers to sort or type QUIT to exit:\n -1 -2 -3 -4ENTER Sorting first half of the array using Bubble Sort algorithm:\n -2 -1 -3 -4\n Sorting second half of the array using Bubble Sort algorithm:\n -1 -2 -4 -3\n Sorting the array using Bubble Sort algorithm:\n -4 -3 -2 -1\n Sorting first half of the array using Insertion Sort algorithm:\n -2 -1 -3 -4\n Sorting second half of the array using Insertion Sort algorithm:\n -1 -2 -4 -3\n Sorting the array using Insertion Sort algorithm:\n -4 -3 -2 -1\n Sorting first half of the array using Selection Sort algorithm:\n -2 -1 -3 -4\n Sorting second half of the array using Selection Sort algorithm:\n -1 -2 -4 -3\n Sorting the array using Selection Sort algorithm:\n -4 -3 -2 -1\n Please enter a space separated list of numbers to sort or type QUIT to exit:\n quitENTER Test Case 3 Please enter a space separated list of numbers to sort or type QUIT to exit:\n QuitENTER Test Case 4 Please enter a space separated list of numbers to sort or type QUIT to exit:\n 0ENTER Sorting first half of the array using Bubble Sort algorithm:\n 0\n Sorting second half of the array using Bubble Sort algorithm:\n 0\n Sorting the array using Bubble Sort algorithm:\n 0\n Sorting first half of the array using Insertion Sort algorithm:\n 0\n Sorting second half of the array using Insertion Sort algorithm:\n 0\n Sorting the array using Insertion Sort algorithm:\n 0\n Sorting first half of the array using Selection Sort algorithm:\n 0\n Sorting second half of the array using Selection Sort algorithm:\n 0\n Sorting the array using Selection Sort algorithm:\n 0\n Please enter a space separated list of numbers to sort or type QUIT to exit:\n qUitENTER Test Case 5 Please enter a space separated list of numbers to sort or type QUIT to exit:\n 1 2 3 10 9 7 8 9 9 9 9 9 1 1 1 1 2 2 2 2 10 10 10 7 7 7 -100ENTER Sorting first half of the array using Bubble Sort algorithm:\n 1 1 2 3 7 8 9 9 9 9 9 9 10 1 1 1 2 2 2 2 10 10 10 7 7 7 -100\n Sorting second half of the array using Bubble Sort algorithm:\n 1 2 3 10 9 7 8 9 9 9 9 9 1 -100 1 1 1 2 2 2 2 7 7 7 10 10 10\n Sorting the array using Bubble Sort algorithm:\n -100 1 1 1 1 1 2 2 2 2 2 3 7 7 7 7 8 9 9 9 9 9 9 10 10 10 10\n Sorting first half of the array using Insertion Sort algorithm:\n 1 1 2 3 7 8 9 9 9 9 9 9 10 1 1 1 2 2 2 2 10 10 10 7 7 7 -100\n Sorting second half of the array using Insertion Sort algorithm:\n 1 2 3 10 9 7 8 9 9 9 9 9 1 -100 1 1 1 2 2 2 2 7 7 7 10 10 10\n Sorting the array using Insertion Sort algorithm:\n -100 1 1 1 1 1 2 2 2 2 2 3 7 7 7 7 8 9 9 9 9 9 9 10 10 10 10\n Sorting first half of the array using Selection Sort algorithm:\n 1 1 2 3 7 8 9 9 9 9 9 9 10 1 1 1 2 2 2 2 10 10 10 7 7 7 -100\n Sorting second half of the array using Selection Sort algorithm:\n 1 2 3 10 9 7 8 9 9 9 9 9 1 -100 1 1 1 2 2 2 2 7 7 7 10 10 10\n Sorting the array using Selection Sort algorithm:\n -100 1 1 1 1 1 2 2 2 2 2 3 7 7 7 7 8 9 9 9 9 9 9 10 10 10 10\n Please enter a space separated list of numbers to sort or type QUIT to exit:\n QUITENTER
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
Related questions
Question
JAVA PROGRAM ASAP
*********** THIS PROGRAM MUST WORK IN HYPERGRADE AND PASS ALL THE TEST CASES.
Please create a program BECAUSE IT IS. MY HOMEWORK ASSIGNMENT with the following parts which are down below:
The left index is inclusive and the right index is exclusive.
1.
public static void bubbleSort(int[] array, int left, int right) {
// your code here
}
2.
public static void insertionSort(int[] array, int left, int right) {
// your code here
}
3.
public static void selectionSort(int[] array, int left, int right) {
// your code here
}
Test Case 1
Please enter a space separated list of numbers to sort or type QUIT to exit:\n
4 3 2 1ENTER
Sorting first half of the array using Bubble Sortalgorithm :\n
3 4 2 1\n
Sorting second half of the array using Bubble Sort algorithm:\n
4 3 1 2\n
Sorting the array using Bubble Sort algorithm:\n
1 2 3 4\n
Sorting first half of the array using Insertion Sort algorithm:\n
3 4 2 1\n
Sorting second half of the array using Insertion Sort algorithm:\n
4 3 1 2\n
Sorting the array using Insertion Sort algorithm:\n
1 2 3 4\n
Sorting first half of the array using Selection Sort algorithm:\n
3 4 2 1\n
Sorting second half of the array using Selection Sort algorithm:\n
4 3 1 2\n
Sorting the array using Selection Sort algorithm:\n
1 2 3 4\n
Please enter a space separated list of numbers to sort or type QUIT to exit:\n
quitENTER
4 3 2 1ENTER
Sorting first half of the array using Bubble Sort
3 4 2 1\n
Sorting second half of the array using Bubble Sort algorithm:\n
4 3 1 2\n
Sorting the array using Bubble Sort algorithm:\n
1 2 3 4\n
Sorting first half of the array using Insertion Sort algorithm:\n
3 4 2 1\n
Sorting second half of the array using Insertion Sort algorithm:\n
4 3 1 2\n
Sorting the array using Insertion Sort algorithm:\n
1 2 3 4\n
Sorting first half of the array using Selection Sort algorithm:\n
3 4 2 1\n
Sorting second half of the array using Selection Sort algorithm:\n
4 3 1 2\n
Sorting the array using Selection Sort algorithm:\n
1 2 3 4\n
Please enter a space separated list of numbers to sort or type QUIT to exit:\n
quitENTER
Test Case 2
Please enter a space separated list of numbers to sort or type QUIT to exit:\n
-1 -2 -3 -4ENTER
Sorting first half of the array using Bubble Sort algorithm:\n
-2 -1 -3 -4\n
Sorting second half of the array using Bubble Sort algorithm:\n
-1 -2 -4 -3\n
Sorting the array using Bubble Sort algorithm:\n
-4 -3 -2 -1\n
Sorting first half of the array using Insertion Sort algorithm:\n
-2 -1 -3 -4\n
Sorting second half of the array using Insertion Sort algorithm:\n
-1 -2 -4 -3\n
Sorting the array using Insertion Sort algorithm:\n
-4 -3 -2 -1\n
Sorting first half of the array using Selection Sort algorithm:\n
-2 -1 -3 -4\n
Sorting second half of the array using Selection Sort algorithm:\n
-1 -2 -4 -3\n
Sorting the array using Selection Sort algorithm:\n
-4 -3 -2 -1\n
Please enter a space separated list of numbers to sort or type QUIT to exit:\n
quitENTER
-1 -2 -3 -4ENTER
Sorting first half of the array using Bubble Sort algorithm:\n
-2 -1 -3 -4\n
Sorting second half of the array using Bubble Sort algorithm:\n
-1 -2 -4 -3\n
Sorting the array using Bubble Sort algorithm:\n
-4 -3 -2 -1\n
Sorting first half of the array using Insertion Sort algorithm:\n
-2 -1 -3 -4\n
Sorting second half of the array using Insertion Sort algorithm:\n
-1 -2 -4 -3\n
Sorting the array using Insertion Sort algorithm:\n
-4 -3 -2 -1\n
Sorting first half of the array using Selection Sort algorithm:\n
-2 -1 -3 -4\n
Sorting second half of the array using Selection Sort algorithm:\n
-1 -2 -4 -3\n
Sorting the array using Selection Sort algorithm:\n
-4 -3 -2 -1\n
Please enter a space separated list of numbers to sort or type QUIT to exit:\n
quitENTER
Test Case 3
Please enter a space separated list of numbers to sort or type QUIT to exit:\n
QuitENTER
QuitENTER
Test Case 4
Please enter a space separated list of numbers to sort or type QUIT to exit:\n
0ENTER
Sorting first half of the array using Bubble Sort algorithm:\n
0\n
Sorting second half of the array using Bubble Sort algorithm:\n
0\n
Sorting the array using Bubble Sort algorithm:\n
0\n
Sorting first half of the array using Insertion Sort algorithm:\n
0\n
Sorting second half of the array using Insertion Sort algorithm:\n
0\n
Sorting the array using Insertion Sort algorithm:\n
0\n
Sorting first half of the array using Selection Sort algorithm:\n
0\n
Sorting second half of the array using Selection Sort algorithm:\n
0\n
Sorting the array using Selection Sort algorithm:\n
0\n
Please enter a space separated list of numbers to sort or type QUIT to exit:\n
qUitENTER
0ENTER
Sorting first half of the array using Bubble Sort algorithm:\n
0\n
Sorting second half of the array using Bubble Sort algorithm:\n
0\n
Sorting the array using Bubble Sort algorithm:\n
0\n
Sorting first half of the array using Insertion Sort algorithm:\n
0\n
Sorting second half of the array using Insertion Sort algorithm:\n
0\n
Sorting the array using Insertion Sort algorithm:\n
0\n
Sorting first half of the array using Selection Sort algorithm:\n
0\n
Sorting second half of the array using Selection Sort algorithm:\n
0\n
Sorting the array using Selection Sort algorithm:\n
0\n
Please enter a space separated list of numbers to sort or type QUIT to exit:\n
qUitENTER
Test Case 5
Please enter a space separated list of numbers to sort or type QUIT to exit:\n
1 2 3 10 9 7 8 9 9 9 9 9 1 1 1 1 2 2 2 2 10 10 10 7 7 7 -100ENTER
Sorting first half of the array using Bubble Sort algorithm:\n
1 1 2 3 7 8 9 9 9 9 9 9 10 1 1 1 2 2 2 2 10 10 10 7 7 7 -100\n
Sorting second half of the array using Bubble Sort algorithm:\n
1 2 3 10 9 7 8 9 9 9 9 9 1 -100 1 1 1 2 2 2 2 7 7 7 10 10 10\n
Sorting the array using Bubble Sort algorithm:\n
-100 1 1 1 1 1 2 2 2 2 2 3 7 7 7 7 8 9 9 9 9 9 9 10 10 10 10\n
Sorting first half of the array using Insertion Sort algorithm:\n
1 1 2 3 7 8 9 9 9 9 9 9 10 1 1 1 2 2 2 2 10 10 10 7 7 7 -100\n
Sorting second half of the array using Insertion Sort algorithm:\n
1 2 3 10 9 7 8 9 9 9 9 9 1 -100 1 1 1 2 2 2 2 7 7 7 10 10 10\n
Sorting the array using Insertion Sort algorithm:\n
-100 1 1 1 1 1 2 2 2 2 2 3 7 7 7 7 8 9 9 9 9 9 9 10 10 10 10\n
Sorting first half of the array using Selection Sort algorithm:\n
1 1 2 3 7 8 9 9 9 9 9 9 10 1 1 1 2 2 2 2 10 10 10 7 7 7 -100\n
Sorting second half of the array using Selection Sort algorithm:\n
1 2 3 10 9 7 8 9 9 9 9 9 1 -100 1 1 1 2 2 2 2 7 7 7 10 10 10\n
Sorting the array using Selection Sort algorithm:\n
-100 1 1 1 1 1 2 2 2 2 2 3 7 7 7 7 8 9 9 9 9 9 9 10 10 10 10\n
Please enter a space separated list of numbers to sort or type QUIT to exit:\n
QUITENTER
1 2 3 10 9 7 8 9 9 9 9 9 1 1 1 1 2 2 2 2 10 10 10 7 7 7 -100ENTER
Sorting first half of the array using Bubble Sort algorithm:\n
1 1 2 3 7 8 9 9 9 9 9 9 10 1 1 1 2 2 2 2 10 10 10 7 7 7 -100\n
Sorting second half of the array using Bubble Sort algorithm:\n
1 2 3 10 9 7 8 9 9 9 9 9 1 -100 1 1 1 2 2 2 2 7 7 7 10 10 10\n
Sorting the array using Bubble Sort algorithm:\n
-100 1 1 1 1 1 2 2 2 2 2 3 7 7 7 7 8 9 9 9 9 9 9 10 10 10 10\n
Sorting first half of the array using Insertion Sort algorithm:\n
1 1 2 3 7 8 9 9 9 9 9 9 10 1 1 1 2 2 2 2 10 10 10 7 7 7 -100\n
Sorting second half of the array using Insertion Sort algorithm:\n
1 2 3 10 9 7 8 9 9 9 9 9 1 -100 1 1 1 2 2 2 2 7 7 7 10 10 10\n
Sorting the array using Insertion Sort algorithm:\n
-100 1 1 1 1 1 2 2 2 2 2 3 7 7 7 7 8 9 9 9 9 9 9 10 10 10 10\n
Sorting first half of the array using Selection Sort algorithm:\n
1 1 2 3 7 8 9 9 9 9 9 9 10 1 1 1 2 2 2 2 10 10 10 7 7 7 -100\n
Sorting second half of the array using Selection Sort algorithm:\n
1 2 3 10 9 7 8 9 9 9 9 9 1 -100 1 1 1 2 2 2 2 7 7 7 10 10 10\n
Sorting the array using Selection Sort algorithm:\n
-100 1 1 1 1 1 2 2 2 2 2 3 7 7 7 7 8 9 9 9 9 9 9 10 10 10 10\n
Please enter a space separated list of numbers to sort or type QUIT to exit:\n
QUITENTER
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 5 images
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.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education