subject

Modify the closest pair of points algorithm so that the separating line L now separates the first n/4 points (sorted according to their r coordinates) from the remaining 3n/4 points. Write the recurrence relation that gives the running time of the modified algorithm. Is the running time of your algorithm still O(nlog n)? Specify the best asymptotic running time you can get for your algorithm and briefly justify.

Now let the line L separate the first √ n points (according to their x- coordinates) from the remaining n - √ n points. Write the recurrence relation that gives the running time of this modification of the algorithm. Is the running time of your algorithm still O(n log n)? If your answer is yes, provide a brief justification; if your answer is no, provide a (asymptotic) lower bound on the running time of the modified algorithm that should be enough to justify your answer.

ansver
Answers: 2

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 18:30
All of the following are characteristics that must be contained in any knowledge representation scheme except
Answers: 3
question
Computers and Technology, 23.06.2019 10:30
Would a ps4 wired controller work on an xbox one
Answers: 1
question
Computers and Technology, 23.06.2019 18:30
How often does colleges update the cost of attendance on their website? . a)every two years b) every four years c) every year d) every semester
Answers: 1
question
Computers and Technology, 24.06.2019 10:50
In 2009 to 2010, how many social network users were reported as being victims of online abuse? a. 1 in 10 b. 100% c.1 in 100 d. 50%
Answers: 2
You know the right answer?
Modify the closest pair of points algorithm so that the separating line L now separates the first n/...
Questions
question
English, 05.12.2021 17:50
question
Mathematics, 05.12.2021 17:50
question
Biology, 05.12.2021 17:50
question
Mathematics, 05.12.2021 18:00