assume the region to be (0,0) , (10,0), (0,10), (10,10) On 22 January 2011 08:33, Dave <[email protected]> wrote:
> @Divya: The coordinates of the points are between 0 and 1 and are > integers. That can't be right. > > Dave > > On Jan 21, 1:46 pm, divya <[email protected]> wrote: > > Within a 2D space, there is a batch of points(no duplicate) in the > > region (0,0),(0,1),(1,0),(1,1), try to find a line which can divide > > the region to 2 parts with half points in each .the input will be an > > array of points and the length of the array. > > struct point{ > > int x; > > int y;}; > > > > input : struct point * points, int length > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
