write a program to solve the Closest Points problem for an input file that contains duplicate x- coordinate values

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

(8 pts)    write a program to solve the Closest Points problem for an input file that contains duplicate x- coordinate values. As an extreme case, the data file could look like this:

 

5 6.7

5 7.1

5 4.2

5 5.7

5 4.9

 

(6 pts)        In addition (on paper for the TA)

 

2. Carefully explain any difficulties your previous (Program 2.1) program would have if the assumption about distinct x-coordinates is

 

2. Carefully explain what changes you made in your Program 2.1 to overcome such

 

1. In the previous version of this problem (with no duplicate x-values), the algorithm used had the following recurrence relation: T(n) = 2T(n/2) + Q(n) plus the time to presort, Q(n lg n).

 

this term includes Q(n) to divide + Q(n) to find Y' + Q(n) to search Y' for points + Q(1) for final comparison

 

So T(n) = Q(n lg n) (recurrence relation we have seen before) + Q(n lg n) (presort), therefore overall T(n) = Q(n lg n).

 

How do the changes in part (b) affect the overall order-of-magnitude of the algorithm?

Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of