Question: ANSWER IN JAVA ASAP Practical application 2: The merge problem. Given two sorted lists of integers, A and B, the aim is to merge A

ANSWER IN JAVA ASAP Practical application 2: The merge problem. Given two sorted lists of integers, A and B, the aim is to merge A and B, producing a sorted list S.

(a) Write an algorithm that stores A and B in two queues (one in each queue), merges A and B, and outputs a sorted list S in O(n) worst-case time. Note: your algorithm must use queues for A, B and S.

(b) Implement your algorithm in your favorite programming language.

(d) [2 bonus marks*] Run your algorithm on randomly generated sorted lists A and B of different sizes: 100, 200, 300, , 2000 and record the CPU time taken by the algorithm. Create a table (or a plot) and explain how your algorithm runs in O(n) by inspecting your results.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Does anyone know how to implement this algorithm in Java?? 6. Practical application 2: The merge problem. Given two sorted lists of integers, A and B, the aim is to merge A and B, producing a sorted...

Use Java 1. Implement a queue on the singly linked list of Item #1, with the following operations: enqueue, dequeue, front, size, isEmpty. Note: both operations, enqueue and dequeue, must run in...

use java Practical application 2: The merge problem. Given two sorted lists of integers, A and B, the aim is to merge A and B, producing a sorted list S. (a) Write an algorithm that stores A and B in...

In Java please and thank you Objective: The aim of this assignment is to obtain hands on experience in implementing ADTs, and understanding the theoretical concepts seen in class on algorithm design...

MergeSort and Quicksort Java code analysis create a Java class to analyze and compare the mergesort and quicksort algorithms. The sort required is always from smallest value to largest value. Your...

I'm receiving an error on my assignment! this is the error: java.lang.AssertionError: expected: but was: Suppose you are given two linked lists of integers, the values in which are non-decreasing...

Python and most Python libraries are free to download or use, though many users use Python through a paid service. Paid services help IT organizations manage the risks associated with the use of...

Write a multithreaded sorting program in Java that works as follows: A collection of items is divided into two lists of equal size. Each list is then passed to a separate thread (a sorting thread),...

Explain assignment operator with example.

1. Distinguish between a job and a career. 2. How do your values affect your trade-offs in career planning? 3. What can be done to enhance your abilities and experiences without working in a job...

Walker has the following bonds in his portfolio: Bond A has 0 % coupon rate, 3 years to maturity, 1 6 % yield to maturity, and a 5 1 , 0 0 0 par valoe. Bond B is a PAR bond with 5 % coupon rate, 2...

Compute EVA given the following: State whether or not the company should take the project and why? Explain

2. Pilot training programs assess the benefits from a small group of trainees before a company commits more resources.

1. The evaluation results can be used to change the program.

5. To determine the financial benefits and costs of the program.