Question
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
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 O(1).
2. 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.
(c) Explain how your algorithm runs in O(n), where n is the length of S. Run the Merge algorithm with the following inputs:
(i) A = 1,3,5,7,9 B = 2,3,6,8,10
(ii) A = 1,2,3,4,5 B = 6,7,8,9,10
(iii) A = 2,4,8,16,32 B = 1,3,5,7,9
(iv) A = 10,11,12,13 B = 1,2,3,4
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started