how should I implement a parametrized version of mergesort that will allow us to choose how many parts the input array will be divided into. This method has to take an integer array and integer K as inputs and produce one integer array as output. It will sort the input array by dividing it into K parts, recursively sorting those parts. In java language

how should I implement a parametrized version of mergesort that will allow us to choose how many parts the input array will be divided into. This method has to take an integer array and integer K as inputs and produce one integer array as output. It will sort the input array by dividing it into K parts, recursively sorting those parts. In java language

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

implement a parametrized version of mergesort that will allow us to choose how many parts the input array will be divided into.This method will take an integer array and integer K as inputs and produce one integer array as output. It will sort the input array by dividing it into K parts, recursively sorting those parts, and using the mergeAll method to merge the K sorted arrays into one sorted array. Implement the mergesortK method public static int[] mergesortK(int[] arr, int k) { return new int[] {-1}; } *must be done in this format and in java please
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
FOR JAVA Write a Java method that takes two 2 dimensional int arrays (a and b) and a 2 dimensional boolean array (c) where all three arrays have the same size. Your method should return an array (result) such that, if a partic- ular element in c is true, then the corresponding (same indexed) element in result must be the multiplication of the the corresponding elements of a and b. If the element in c is false, then the the corresponding element in result must be the negative of multiplication of the the corresponding element in a and b. For example ifa = {{1,2,3},{4,5}},b = {{1,2,1},{0,2}} andc = {{true,false,true},{false,true}}, then the result should be result={{1, -4, 3}{0, 10}}.
create a generic array stack and push/pop a million random ints using java.util.Random class. you also want to detect the time it takes to push and pop elements from the stack and you need to run the test multple times to see how the running time grows with increasing number of operations. use a outer loop that runs the program a million times (e.g. for(int i = 1; i<1000000; i+=1000000)).
In the Java class MatrixHelix, implement the method int[][] helix(int[][]) that returns a matrix of identical dimensions to the input matrix, but with the contents in helix order. Your implementation should account for matrices of different sizes and should handle corner cases as well (0 x 0 matrices and 1 x 1 matrix, for example). Examples The matrix 1 2 34 5 67 8 9would become 1 2 38 9 47 6 5after the helix morph. The matrix 7 5 1 4 63 2 9 1 88 3 2 4 110 11 15 19 14 would become 7 5 1 4 64 1 10 11 32 14 19 15 23 8 8 1 9after spiralizing. Implement all the methods that are indicated with //MODIFY THIS METHOD and // ADD TESTS TO CHECK PARTITIONS.
Write a Java method that takes two 2 dimensional int arrays (a and b) anda 2 dimensional boolean array (c) where all three arrays have the samesize. Your method should return an array (result) such that, if a particular element in c is true, then the corresponding (same indexed) elementin result must be the multiplication of the the corresponding elements ofa and b. If the element in c is false, then the the corresponding elementin result must be the negative of multiplication of the the correspondingelement in a and b.
Write a program in java that randomly fills in 0s and 1s into an n-by-n matrix, prints the matrix, and finds the rows and columns with the most 1s. (Hint: Use two ArrayLists to store the row and column indices with the most 1s.)
Design and implement an insertSorted() method for the MyArrayList class. The method should receive a single object and insert it in its correct position. You can assume that the calling array is already in a sorted order. The calling array is therefore updated. Follow the three step method for designing the method. Develop the java code for the method. Create a test program to test the method thoroughly using the Integer wrapper class.
Write a program in java for the below given problem statement: Given 2 sorted arrays (in increasing order), find a path through the intersection that produces themaximum sum and return the maximum sum. That is, we can switch from one array to another array only atcommon elements. If no intersection element is present, we need to take the sum of all elements from thearray with greater sum.Sample Input:61 5 10 15 20 2552 4 5 9 15Sample Output :81Explanation :We start from array 2 and take sum till 5 (sum = 11). Then we'll switch to array at element 10 and take till15. So sum = 36. Now, no elements are left in array after 15, so we'll continue in array 1. Hence the sum is81.
in java lanuage please You have been given two sorted arrays (in increasing order), find a path through the intersectionsthat produces maximum sum and return the maximum sum.That is, you can switch from one array to another array only at common elements.If no intersection element is present, we need to take sum of all elements from the array with greatersum.Input Format:Line 1: Size of first arrayLine 2: Elements of first arrayLine 3: Size of second arrayLine 4: Elements of second arrayOutput Format:The maximum sumSample Input:61 5 10 15 20 2552 4 5 9 15Sample Output:81Explanation:We will start from second array and take sum till 5 which will be equal to 11. Then we'll switch tofirst array because both arrays are intersecting at 5 so then we will start from element 10 and take till15 and the sum will become 36. Now again both arrays are intersecting at 15 but there are noelements left in second array after 15, so we'll continue with first array. Hence sum will be 81. in java
Java. Implement a method that will return a String with an array's elements separated by spaces. The mehod will recieve three parameters: the integer array, a start index, and an end index. Both start and end are includive. The method's signature is as follows: public static String printRange(int [], int, int) - make the method public to faciliate testing - If the indexes are outside the bounds of the array, the method should return "Invalid Range." Otherwise, the method will return a String containing one integer after the other on the same line separated by one space. Example 1: Given {4,1,2,36,6}, 1, 3 as the parameters; the method should return "1 2 36" Example 2: Given {4,1,2,36,6}, 0, 7 as the parameters; the method should return "Invalid Range"
Implement quicksort in a JAVA programming language. The first version will use the first element of the array as the pivot. Please help me with a Java code , It needs to take the input from a file of 100 data elements. Can someone please help me with this coding problem. I have the data set file , but I cannot upload it in here. Kindly help me with the code.