Recent content by b-boy

yes you understood me correctly and pointed out something that i did not see. My cases were ususly two uniformly (more or less) distributed sets. A= {1,3,5,7} and B = {2,4,6,8} and A <<B. but now when you pointed the flaw in my logic i have to reconsider my problem , thank you.

Let say i have two sets of numbers A and B. and I want to assigne to each number from A two slosest numbers from B. What i would do is to pick an elements from A and then go through the entire B set and find two closest. now if i go the other way arround in orderd to achieve the same result i...