I think for initial start it should be the minimum n values for n milestones....
On Thu, Jul 7, 2011 at 1:53 PM, Akshata Sharma <akshatasharm...@gmail.com>wrote: > There is a straight roads with 'n' number of milestones. You are given an > array with the distance between all the pairs of milestones in some random > order. Find the position of milestones. > Example: > Consider a road with 4 milestones(a,b,c,d) : > a <--- 3Km --->b<--- 5Km --->c<--- 2Km --->d > Distance between a and b = 3 > Distance between a and c = 8 > Distance between a and d = 10 > Distance between b and c = 5 > Distance between b and d = 7 > Distance between c and d = 2 > All the above values are given in a random order say 7, 10, 5, 2, 8, 3. > The output must be 3,5,2 or 2,5,3 > > -- > 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. > -- *Piyush Sinha* *IIIT, Allahabad* *+91-8792136657* *+91-7483122727* *https://www.facebook.com/profile.php?id=100000655377926 * -- 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.
