Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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

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]

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 !

(1) [100 points] Implement the function in such a way that your solution solves the problem with O(n log2(n)) time complexity overall but stays within the bounds of O(1) 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 Quick Sort. Please state as code comment which sorting routine you are using, 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. However, at this stage of the course we will not be considering any memory used by recursion.

Very Very Important :

Your code should be well commented which explains all the steps you are performing to solve the problem. A submission without code comments will immediately be deducted 15 points !

As a comment in your code, please write your test-cases on how you would test your solution assumptions and hence your code.

A submission without test cases will immediately be deducted 15 points ! 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.

Please Remember : Although, written as comments - You will address your test cases in the form of code and not prose :)

One question are asked. Don't attempted I've recently received a slew of incommplete responses, which is extremely frustrating. Please don't squander your or my time. There are so many answers in chegg but some are not correct or incomplete. If you are unable to answer of my question, please disregard them. I don't want to squander my paid-for post-question time. Also, if you continue to give me incompplete answer, I will give you a thumbs down and will complain. Thank you very much.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Graph Databases New Opportunities For Connected Data

Authors: Ian Robinson, Jim Webber, Emil Eifrem

2nd Edition

1491930896, 978-1491930892

More Books

Students also viewed these Databases questions

Question

please try to give correct answer 4 7 3 .

Answered: 1 week ago

Question

Ensure continued excellence in people management.

Answered: 1 week ago

Question

Enhance the international team by recruiting the best people.

Answered: 1 week ago