Please answer the following question attached below(use java ) and also add necessary comments for understanding 1. With the partial implementation of the "Merge-Sort" algorithm (shown below),namely, merge() and mergeSort(), build a test program that sorts an unsorted arrayof the size of 20. You may need Queue, LinkedQueue or any other classes andinterfaces to import./** Merge contents of arrays S1 and S2 into properly sized array S. */public static void merge (K[] S1, K[] s2, K[] S, comparator comp) {int i = 0, j = 0;while (i + j < S.length) {if (j == S2.1length || (i < S1.length && comp.compare(S1[i], S2[j]) < 0))S[i+j] = S1[i++];else// copy ith element of S1 and increment iS[i+j] = S2[j++];}}/** Merge-sort contents of array S. */public static void mergeSort (K[] S, Comparator comp) {int n = S.length;if (n < 2) return;// divideint mid = n/2;// copy jth element of S2 and increment j// array is trivially sorted// copy of first half// copy of second halfK[] s1 = Arrays.copy0fRange (S, 0, mid);K[] s2 = Arrays.copy0fRange (S, mid, n);// conquer (with recursion)mergeSort(S1, comp);mergeSort(S2, comp);// merge resultsmerge(S1, S2, S, comp);// sort copy of first half// sort copy of second half// merge sorted halves back into original

1. With the partial implementation of the "Merge-Sort" algorithm (shown below), namely, merge( ) and mergeSort(), build a test program that sorts an unsorted array of the size of 20. You may need Queue, LinkedQueue or any other classes and interfaces to import. /** Merge contents of arrays S1 and S2 into properly sized array S. */ public static void merge(K[] s1, K[] S2, K[] s, Comparator comp) { int i = 0, j = 0; while (i + j < S.length) { if (j == S2.1ength || (i < s1. length && comp.compare(S1[i], S2[j]) < e)) S[i+j] = S1[i++]; else // copy ith element of S1 and increment i // copy ith element of S2 and increment j S[i+j] = S2[j++]; } } /** Merge-sort contents of array S. */ public static void mergeSort (K[] S, Comparator comp) { int n = S.length; if (n < 2) return; // divide int mid = n/2; K[] s1 = Arrays.copy0fRange (S, e, mid); K[] s2 = Arrays.copy0fRange (S, mid, n); // conquer (with recursion) mergeSort(S1, comp); mergeSort(S2, comp); // merge results merge (S1, S2, s, comp); // array is trivially sorted // copy of first half // copy of second half // sort copy of first half // sort copy of second half // merge sorted halves back into original

1. With the partial implementation of the "Merge-Sort" algorithm (shown below), namely, merge( ) and mergeSort(), build a test program that sorts an unsorted array of the size of 20. You may need Queue, LinkedQueue or any other classes and interfaces to import. /** Merge contents of arrays S1 and S2 into properly sized array S. */ public static void merge(K[] s1, K[] S2, K[] s, Comparator comp) { int i = 0, j = 0; while (i + j < S.length) { if (j == S2.1ength || (i < s1. length && comp.compare(S1[i], S2[j]) < e)) S[i+j] = S1[i++]; else // copy ith element of S1 and increment i // copy ith element of S2 and increment j S[i+j] = S2[j++]; } } /** Merge-sort contents of array S. */ public static void mergeSort (K[] S, Comparator comp) { int n = S.length; if (n < 2) return; // divide int mid = n/2; K[] s1 = Arrays.copy0fRange (S, e, mid); K[] s2 = Arrays.copy0fRange (S, mid, n); // conquer (with recursion) mergeSort(S1, comp); mergeSort(S2, comp); // merge results merge (S1, S2, s, comp); // array is trivially sorted // copy of first half // copy of second half // sort copy of first half // sort copy of second half // merge sorted halves back into original

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

Similar questions

Find out the key distinctions between a constructor and a method.
Please answer this in Java code
Write The Use Of Package.
Use java how to make my reset button work? I'm looking for implementation code step by step to activate the resert button When user clicks on the "Reset" button, form fields should reset to default values.
In this assignment you will demonstrate your knowledge of debugging by fixing the errors you find in the program below. Fix the code, and paste it in this document, along with the list of the problems you fixed.This example allows the user to display the string for the day of the week. For example, if the user passed the integer 1, the method will return the string Sunday. If the user passed the integer 2, the method will return Monday. This code has both syntax errors and logic errors. Hint: There are two logic errors to find and fix (in addition to the syntax errors).Inport daysAndDates.DaysOfWeek;public class TestDaysOfWeek {public static void main(String[] args) {System.out.println("Days Of week: ");for (int i = 0;i < 8;i++) {System.out.println("Number: " + i + "\tDay Of Week: " + DaysOfWeek.DayOfWeekStr(i) )}}}package daysAndDatespublic class DaysOfWeek {public static String DayOfWeekStr(int NumberOfDay) {String dayStr = ""switch (NumberOfDay) {case 1:dayStr =…
For c++. Need help designing class, no namespsace. FoodWastageRecord NOTE: You need to design this class. It represents each food wastage entry recorded by the user through the form on the webpage (frontend). If you notice the form on the webpage, you’ll see that each FoodWastageRecord will have the following as the data members aka member variables. Date (as string) Meal (as string) Food name (as string) Quantity in ounces (as double) Wastage reason (as string) Disposal mechanism (as string) Cost (as double) Each member variable comes with its accessor/mutator functions. --------------------------------------------------------------------------------- FoodWastageReport NOTE: You need to design this class. It represents the report generated on the basis of the records entered by the user. This class will be constructed with all the records entered by the user as a parameter. It will then apply the logic to go over all the records and compute the following: Names of most commonly…
Part 2 of 3- Consider the pseudo-code method below: Printones (n) if n == 0 then print ("1") else for i - 1 to 3 RKÅREQDEE (n-1)
What is the meaning of "Regular Expression"? Why did we do it? What is the difference between a regular expression and a descriptive method? Please provide specifics.
Use the left to right addition method as outlined in the module to add the numbers. For the middle row of answers, if the number above needs an underline, type in an underline (_). Otherwise leave it blank. Show all work using the correct method on your handwritten work/answer sheet. 9818 + 3871
This assignment will help you to get started with NetBeans and using Java compiler: To begin, put a block comment at the beginning of your Java file (and every Java source file in the future) with the assignment number, assignment title, program author [your name], and the date it's due. Next, similar to the programs presented in the first chapter of the textbook, use System.out object to display the following information: Your first name The name of the operating system you are using The name of your project (or simply the folder name if not using the IDE) The name of the class that contains the main() method in your source file. Note: Your program should print each of the above items on a separate output line. "The name of the class that contains the main() method in your source file.public class MyClass { public static void main(String[]) { System.out.println( "Hi" ); }}
What is the meaning of "Regular Expression"? Why did we do it? What is the difference between a regular expression and a descriptive method? Please provide specifics.
Write short note on black box testing.