Description: Give your algorithm designed to solve the following pseudo code and the problem of complexity: Let B = {b1, b2,, bn} and W = {w1, w2,, wn} is flat black spots and white spots on the two collection. A black dot bi = (xi, yi) with a white wj = (xj, yj) match if and only if xi ≥ xj and yi ≥ yj. Design a greedy algorithm to find the maximum match between black and white point number. Complexity of the algorithm to be as close as possible nlgn.
To Search:
File list (Check if you may need any files):
黑白匹配问题\Cpp1.cpp
............\测试数据.txt
黑白匹配问题
Download