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

Create a class with [3][3] dimension and the java programshould display the magic square. Kindly explain each statement that you will use.
First, a quick definition of the method should be given before moving on to the three components that make it up.
This is an incomplete code. Where are the implementations for each method you mentioned in the comments? I need the implementation logic (code) for each method you mentioned in the comments. Please include the code implementation logic for each method instead of the comments.
Find out the key distinctions between a constructor and a method.
Please answer this in Java code
Write The Use Of Package.
i am trying to write code for c#. the gui is set up. i have 3 list boxes each with 3 items and each item has a different price. customer should select one from each list box and then be presented with a total price. i'm struggling to know what is the first thing i do. i have the using information, namespace......do i begin after Initialize Component?
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 =…
Do Java code
An alternative approach to creating methods using heredocs.
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…