JAVA. PLEASE ADD COMMENTS TO CODE ALSO INCLUDE TEST CASES IN THE FORM OF CODE AND NOT PROSE     Below is how the filenames are represented ARRAY[] = [50, 11, 33, 21, 40, 50, 40, 40, 21] Below is the expected output after de-duplication ARRAY[] = [11, 21, 33, 40, 50]   Notice the reduced size of the output array. Also, take a look again at the input array and be reminded that the input array is not sorted ! Further, please DO NOT use library functions to either sort and or perform the de-duplication operation.   (1) Implement your solution in such a way that your solution uses Bubble Sort as a sorting routine which brings the sorting time complexity to O(nˆ2). After sorting, solve the de-duplication problem. De-duplication part of the solution in itself must adhere to O(n) time and O(1) space bounds.   Example of cases to be tested for are like : What if the array input which is expected does not exist - that is , input is a null. How should your code handle such a situation ? Maybe output some message like ”Null input case, so no output”? What if the length of the array is one ?....so on and so forth.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

JAVA.

PLEASE ADD COMMENTS TO CODE ALSO INCLUDE TEST CASES IN THE FORM OF CODE AND NOT PROSE

 

 

Below is how the filenames are represented

ARRAY[] = [50, 11, 33, 21, 40, 50, 40, 40, 21]

Below is the expected output after de-duplication

ARRAY[] = [11, 21, 33, 40, 50]

 

Notice the reduced size of the output array.

Also, take a look again at the input array and be reminded that the input array

is not sorted !

Further, please DO NOT use library functions to either

sort and or perform the de-duplication operation.

 

(1) Implement your solution in such a way that your solution

uses Bubble Sort as a sorting routine which brings the sorting time

complexity to O(nˆ2). After sorting, solve the de-duplication problem.

De-duplication part of the solution in itself must adhere to O(n) time and

O(1) space bounds.

 

Example of cases to be tested for are like : What if the array input which

is expected does not exist - that is , input is a null. How should your code

handle such a situation ? Maybe output some message like ”Null input

case, so no output”? What if the length of the array is one ?....so on and

so forth.

 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY