ARRAY[] = [50, 11, 33, 21, 40, 50, 40, 40, 21] ARRAY[] = [11, 21, 33, 40, 50]
java
ARRAY[] = [50, 11, 33, 21, 40, 50, 40, 40, 21]
ARRAY[] = [11, 21, 33, 40, 50]
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
(1) Implement the function in such a way that your solution
solves the problem with O(n log2(n)) time complexity overall and O(n)
space complexity. Here, n is the length of the list of input integers (array).
I believe the sorting routine that can be used here is Merge Sort. Please
state as code comment which sorting routine you are using, sort the arrray with that
De-duplication part of the solution in itself must adhere to O(n) time and
O(1) space bounds. we will not use any memory used by recursion.
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
BOUNDS exception, while looping
through your input array.
Make sure the input is VALID input - Else DO NOT
ABRUPTLY EXIT the Program -
Prompt the user of this scenario
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
