One dimensional binary searching Given a list of N (unique) points on a line, locate all the points ...

Please Visit: http://ift.tt/1ajReyV

One dimensional binary searching

Given a list of N (unique) points on a line, locate all the points in a

given interval on that line.

Input: {p1, p2, p3, p4, ... pN}, [x, x']

Output: {pi | x <= pi <= x'}

http://ift.tt/1DIiDwm

http://ift.tt/1Cvv8d6

One dimensional binary searching

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1DIiB7v

via LifeLong Community