You've done merge, so now time to mergesort! Create a public class named Mergesort that provides a single instance method (this is required for testing) named mergesort. mergesort accepts an array of ints and returns a sorted (ascending) array. You should not modify the passed array. If the array that is passed is null you should throw an IllegalArgumentException. Mergesort should extend Merge, and its parent provides several helpful methods: • int[] merge (int[] first, int[] second): this merges two sorted arrays into a second sorted array. If either array is null it throws an IllegalArgumentException, so don't call it on null arrays. • int[] copyOfRange (int[] original, int from, int to): this acts as a wrapper on java.util.Arrays.copyOfRange, accepting the same arguments and using them in the same way.

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
icon
Related questions
Question

write in java

 
Homework: Mergesort
You've done merge, so now it's time to mergesort!
Create a public class named Mergesort that provides a single instance method (this is
required for testing) named mergesort. mergesort accepts an array of ints and returns a
sorted (ascending) array. You should not modify the passed array. If the array that is passed
is null you should throw an IllegalArgumentException.
Mergesort should extend Merge, and its parent provides several helpful methods:
int[] merge (int[] first, int[] second): this merges two sorted arrays into a
second sorted array. If either array is null it throws an IllegalArgumentException,
so don't call it on null arrays.
• int[] copyOfRange (int[] original, int from, int to): this acts as a
wrapper on java.util.Arrays.copyOfRange,
accepting the same arguments and
using them in the same way.
(You can't use java.util.Arrays in this problem for reasons that will become obvious if
you inspect the rest of the documentation...)
Note that you do need to use merge and call it the correct number of times. This will be
tested during grading.
Transcribed Image Text:Homework: Mergesort You've done merge, so now it's time to mergesort! Create a public class named Mergesort that provides a single instance method (this is required for testing) named mergesort. mergesort accepts an array of ints and returns a sorted (ascending) array. You should not modify the passed array. If the array that is passed is null you should throw an IllegalArgumentException. Mergesort should extend Merge, and its parent provides several helpful methods: int[] merge (int[] first, int[] second): this merges two sorted arrays into a second sorted array. If either array is null it throws an IllegalArgumentException, so don't call it on null arrays. • int[] copyOfRange (int[] original, int from, int to): this acts as a wrapper on java.util.Arrays.copyOfRange, accepting the same arguments and using them in the same way. (You can't use java.util.Arrays in this problem for reasons that will become obvious if you inspect the rest of the documentation...) Note that you do need to use merge and call it the correct number of times. This will be tested during grading.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Array
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
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education