Below is how the arrays are represented ARRAY1[] = [1, 5, 6, 6, 9, 9, 9, 11, 11, 21] Here length of ARRAY1 is m. ARRAY2[] = [6, 6, 9, 11, 21, 21, 21] Here length of ARRAY2 is n. Array to be returned would be: ARRAY[] = [6, 9, 11, 21] ATTN : Further, please be reminded that you cannot use library functions to either sort and or perform the de-duplication operation. solve the problem in two ways In a separate implementation, code up a solution in such a way that your solution solves the problem with O(nlog(m)) time complexity 2 or O(mlog(n)) time complexity. Here log means to the base of 2. I’m sure you already know that the hint is to use Binary Search. In the form of sentences, as a comment in your code (at the bottom of your Solution2), you are required to suggest how can Solution2 be improved by leveraging the fact that both the arrays are already sorted. Suggest a solution so that your suggested solution can run linearly with O(m + n) time complexity. Your suggestion should be no more than 5 sentences :) Important: Take the size of the input array from the User. Prompt user to input the integers in the array. PLEASE MAKE SURE TO EXPLAIN THE SORTING ALGORITHM AND DE-DUPLICATION ALGORITHM IN COMMENTS WHILE YOU CODE! MAKE SURE YOU WRITE YOUR TEST CASES AS WELL IN YOUR COMMENTS! Input array is Null or Empty array - Prompt user saying array is empty or null SHOULD NOT THROW NULLPOINTER EXCEPTION. Make sure not to throw ARRAY INDEX OUT OF
Below is how the arrays are represented ARRAY1[] = [1, 5, 6, 6, 9, 9, 9, 11, 11, 21] Here length of ARRAY1 is m. ARRAY2[] = [6, 6, 9, 11, 21, 21, 21] Here length of ARRAY2 is n. Array to be returned would be: ARRAY[] = [6, 9, 11, 21] ATTN : Further, please be reminded that you cannot use library functions to either sort and or perform the de-duplication operation. solve the problem in two ways In a separate implementation, code up a solution in such a way that your solution solves the problem with O(nlog(m)) time complexity 2 or O(mlog(n)) time complexity. Here log means to the base of 2. I’m sure you already know that the hint is to use Binary Search. In the form of sentences, as a comment in your code (at the bottom of your Solution2), you are required to suggest how can Solution2 be improved by leveraging the fact that both the arrays are already sorted. Suggest a solution so that your suggested solution can run linearly with O(m + n) time complexity. Your suggestion should be no more than 5 sentences :) Important: Take the size of the input array from the User. Prompt user to input the integers in the array. PLEASE MAKE SURE TO EXPLAIN THE SORTING ALGORITHM AND DE-DUPLICATION ALGORITHM IN COMMENTS WHILE YOU CODE! MAKE SURE YOU WRITE YOUR TEST CASES AS WELL IN YOUR COMMENTS! Input array is Null or Empty array - Prompt user saying array is empty or null SHOULD NOT THROW NULLPOINTER EXCEPTION. Make sure not to throw ARRAY INDEX OUT OF
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
Related questions
Question
Below is how the arrays are represented
ARRAY1[] = [1, 5, 6, 6, 9, 9, 9, 11, 11, 21]
Here length of ARRAY1 is m.
ARRAY2[] = [6, 6, 9, 11, 21, 21, 21]
Here length of ARRAY2 is n.
Array to be returned would be:
ARRAY[] = [6, 9, 11, 21]
ATTN : Further, please be reminded that you cannot use library functions to either
sort and or perform the de-duplication operation.
solve the problem in two ways
- In a separate implementation, code up a solution in such a way that your solution solves the problem with O(nlog(m)) time complexity 2 or O(mlog(n)) time complexity. Here log means to the base of 2. I’m sure you already know that the hint is to use Binary Search.
- In the form of sentences, as a comment in your code (at the bottom of your Solution2), you are required to suggest how can Solution2 be improved by leveraging the fact that both the arrays are already sorted. Suggest a solution so that your suggested solution can run linearly with O(m + n) time complexity. Your suggestion should be no more than 5 sentences :)
Important: Take the size of the input array from the User.
Prompt user to input the integers in the array.
PLEASE MAKE SURE TO EXPLAIN THE SORTING
COMMENTS WHILE YOU CODE!
MAKE SURE YOU WRITE YOUR TEST CASES AS WELL IN
YOUR COMMENTS!
Input array is Null or Empty array - Prompt user saying
array is empty or null
SHOULD NOT THROW NULLPOINTER EXCEPTION.
Make sure not to throw ARRAY INDEX OUT OF
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 4 images
