Consider that there are n (finite)individuals standing at different points on a line.Now we need to find the meeting point of all the n .They can move either left or right and every single step is added to the output .
This same problem is extended for a 2D array. here they can move up down left right .find the meeting point. Note meeting point neednt be the point of one of the n individuals -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
