# Below is how the filenames are represented ARRAY[] = [50, 11, 33, 21, 40, 50, 40, 40, 21] Below…

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]

ATTN : 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 be reminded that you cannot use library functions to either sort and or perform the de-duplication operation. Doing so would straight up result in a score of Zero !

You will solve the problem in two ways:-

1. (1) [50 points] Implement the function in such a way that your solution solves the problem with O(n2) time complexity overall and O(1) space complex- ity. Here, n is the length of the list of input integers (array). In this part of the problem you will be using the Selection Sort Algorithm that we covered in class. Please sort the array with that algorithm and solve the de-duplication problem thereafter. De-duplication part of the solution in itself must adhere to O(n) time and O(1) space bounds.(2) [50 points] In a separate implementation, code up a solution in such a way that your solution solves the problem with O(n2) time complexity overall and stays within the bounds of O(1) space complexity. Here, n is the length of the list of input integers (array). In this part of the problem you will be using the Bubble Sort Algorithm that we covered in class. Please sort the array with that algorithm and solve the de-duplication problem thereafter. De-duplication part of the solution in itself must ad- here to O(n) time and O(1) space bounds.

2. (2) [50 points] In a separate implementation, code up a solution in such a way that your solution solves the problem with O(n2) time complexity overall and stays within the bounds of O(1) space complexity. Here, n is the length of the list of input integers (array). In this part of the problem you will be using the Bubble Sort Algorithm that we covered in class. Please sort the array with that algorithm and solve the de-duplication problem thereafter. De-duplication part of the solution in itself must ad- here to O(n) time and O(1) space bounds.

## Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
\$26
The price is based on these factors:
Number of pages
Urgency
Basic features
• Free title page and bibliography
• Unlimited revisions
• Plagiarism-free guarantee
• Money-back guarantee
On-demand options
• Writer’s samples
• Part-by-part delivery
• Overnight delivery
• Copies of used sources
Paper format
• 275 words per page
• 12 pt Arial/Times New Roman
• Double line spacing
• Any citation style (APA, MLA, Chicago/Turabian, Harvard)

# Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

### Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

### Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

### Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.