Hello,
I am working on the following problem. I need a divide and conquer
algorithm to solve the following problem. Any help is appreciated.
I have a set of coordinates (x,y) and each coordinate has an ID and
load factor. The load factor is a count of all the coordinates that
are northeast of a point (x,y) (i.e. all points (x_i,y_i) such that
x_i>=x and y_i>=y). Does anyone know a divide and conquer algorithm i
can use to compute the load factors for the set of coordinates?
Example:
If the user input the following coordinates, the program needs to
output the listed loadfactors:
ID coordinate load factor
12 (3,3) 1
10 (4,2) 1
13 (5,6) 0
7 (2,1) 3