Write a Java method that merges two sorted lists into a new sorted list. public static int[] merge(int[] listl, int[] list2) Write a Java test Program that prompts the user to enter two sorted lists and displays the merged list. Here is a sample run. Note that the first number in the input indicates the number of the elements in the list. This number is not part of the list. Enter listl: 5 1 5 16 61 111 JEnter Enter list2: 4 2 4 5 6 -Enter The merged list is 1 2 4 5 5 6 16 61 111

Write a Java method that merges two sorted lists into a new sorted list. public static int[] merge(int[] listl, int[] list2) Write a Java test Program that prompts the user to enter two sorted lists and displays the merged list. Here is a sample run. Note that the first number in the input indicates the number of the elements in the list. This number is not part of the list. Enter listl: 5 1 5 16 61 111 JEnter Enter list2: 4 2 4 5 6 -Enter The merged list is 1 2 4 5 5 6 16 61 111

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

Write a java code for the following. Write two methods that return the union and intersection of two arrays of integers using the following header: public int[ ] union(int arr[ ]) public int[ ] intersection(int arr[ ]) For example, the union of two array lists {2, 3, 1, 5} and {3, 4, 6} is {2, 3, 1, 5, 3, 4, 6} and intersection is {3}. Write a test program that prompts the user to enter two lists of size 4 each, and displays their union and intersection. The numbers are separated by exactly one space in the output.
(a) Write a method public static void insert(int[] a, int n, int x) that inserts x in order among the first n elements of a, assuming these elements are arranged in ascending order. Do NOT use arraylists. x is the last element in a. n does not include x. (b) Using the insert method from Part (a), write a recursive implementation of Insertion Sort.
java Write a program that implements the methods of a list using LINKED LISTS. Send source code END(L) PRINT_LIST(L) INSERT(x,p,L) LOCATE(x, L) RECOVER(p,L) DELETE(p, L) NEXT(p,L) PREVIOUS(p,L) DESTROY(L) FIRST(L) EMPTY(L ) * This is a function that returns true if the list is empty and false if the list is not empty. Create a menu with an option for each of the list methods. Validate p(position) between 1 and the size of the list.
Stuck on this problem, in java pls. Write a void method selectionSortDescendTrace() that takes an integer array, and sorts the array into descending order. The method should use nested loops and output the array after each iteration of the outer loop, thus outputting the array N-1 times (where N is the size). Complete main() to read in a list of up to 10 positive integers (ending in -1) and then call the selectionSortDescendTrace() method. If the input is: 20 10 30 40 -1 then the output is: 40 10 30 20 40 30 10 20 40 30 20 10 Provided code: import java.util.Scanner; public class DescendingOrder { // TODO: Write a void method selectionSortDescendTrace() that takes // an integer array and the number of elements in the array as arguments, // and sorts the array into descending order. public static void selectionSortDescendTrace(int [] numbers, int numElements) { } public static void main(String[] args) { Scanner scnr = new Scanner(System.in);…
Write a method that removes the duplicate elements froman array list of integers using the following header:public static void removeDuplicate(ArrayList<Integer> list)Write a test program that prompts the user to enter 10 integers to a list and displaysthe distinct integers in their input order and separated by exactly one space.Here is a sample run: Enter 10 integers: 34 5 3 5 6 4 33 2 2 4 ↵EnterThe distinct integers are 34 5 3 6 4 33 2
Write a program in java that prompts the user to enter an inte- ger m and find the smallest integer n such that m * n is a perfect square. (Hint: Store all smallest factors of m into an array list. n is the product of the factors that appear an odd number of times in the array list. For example, consider m = 90, store the factors 2, 3, 3, and 5 in an array list. 2 and 5 appear an odd number of times in the array list. Thus, n is 10.)
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.
Java Collections Write a method called pairCounts that accepts a list of strings representing individual words and counts the number of occurrences of all 2-character sequences of letters in those words. For example, suppose the list contains ["banana", "bends", "i", "mend", "sandy"]. This list contains the following two-character pairs: "ba", "an", "na", "an", "na" from "banana"; "be", "en", "nd", "ds" from "bends"; "me", "en", "nd" from "mend"; and "sa", "an", "nd", "dy" from "sandy". (Note that "i" is only one character long, so it contains no pairs.) Your method should count the occurrences of these pairs of letters and return the counts as a Map. In this case you would return {an=3, ba=1, be=1, ds=1, dy=1, en=2, me=1, na=2, nd=3, sa=1}. Notice that pairings that occur more than once in the same word should be counted as separate occurrences. For example, "an" and "na" each occur twice in "banana".
JAVA: Write a recursive method named threeSum that accepts a list of integers and prints all combinations of three integers in the list that sum to 0. For example, if given the list [-1, 0, 1, 2, -1, -4], print the following lines of output: [-1, 0, 1] [-1, 2, -1] [0, 1, -1] You may print the lines of output in any order. The elements in each three-element sublist should appear in the same relative order that they appeared in the original list. Do not print duplicate lists; if the same exact sublist can be made in multiple ways, print it only once. If there are no combinations of three elements that sum to 0, print no output. The list passed to your method must be back to its original state at the end of the call. Either do not modify it, or if you modify it, fully undo your modifications before the method returns. Constraints: Do not declare any global variables. You can use any data structures you like, and your code can contain loops, but the overall algorithm must be recursive and…
You are given a java program that creates a list of strings containing the names of some fruits, and then prints out the names of the fruits in reverse order: import java.util.*; public class FruitListExercise { public static void main(String[] args) { List<String> fruits = new ArrayList<>(); fruits.add("apple"); fruits.add("banana"); fruits.add("orange"); Collections.reverse(fruits); for (String fruit : fruits) { System.out.println(fruit); } } } Your job is to modify the above code to ask the user for the name of the fruits and print them in alpha order.
Write a Program in Java programming: Support you have an ArrayList containing random integers. These integers can be any number, and each integer can appear more than once. For example, [2, 19, 21, 19, 21, 1, 3, 3, 6, 21, .....] Your job is to write a method called findEvenFrequentNumbers(ArrayList<Integer> list) that returns an ArrayList which has all the numbers appears in even frequency and in increasing order. e.g. list = [2, 19, 21, 19, 21, 1, 3, 3, 6, 21], should return [3, 19] list = [3, 3, 3, 1, 2, 2, 2, 2, 2], should return [] list = [1, 1, 1, 1, 1], should return [1] Note that you need to provide a class with the main function and also the imports.
run the main() method of class Lab11D. Pls do the SWAPIN LAB 11D and below is the tester For example, A B C D E F should turn into D E F A B C. You should assume that the array list has an even number of elements (not necessarily 6). One solution is to keep removing the element at index 0 and adding it to the back. Each step would look like this: A B C D E F B C D E F A C D E F A B D E F A B C When you run the code, you will find that there is a lot of movement in the array list. Each call to remove(0) causes n - 1 elements to move, where n is the length of the array. If n is 100, then you move 99 elements 50 times, (almost 5000 move operations). That's an inefficient way of swapping the first and second halves. (Learn more about time complexity at the end of the lab). Come up with a better way in which you swap the elements directly. Hint: How do you swap the two elements A and D? A B C D E F D B C A E F D E C A B F D E F A B C Write pseudocode for this algorithm. Add…