a king has two sons eric and bob.....he wants to divide his islands.... the islands are in a queue.....eric being elder gets the first chance....they both can pick d island alternatively from beginning or end of the queue only.....design an algo so tht eric gets the max. piece of land..... i hv solved it if the no of islands are even.... bt nt getting any clue whn no of islands are odd.... in the odd case....i think bob vl hv an advantage ovr eric....but how to develop strategy for eric(if no of islands are odd)....
-- 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.
