There are 100 pertrol pumps between two points A and B. You have to select 10(say) petrol pumps such that the largest distance between any two petrol pumps shud be minimum.
-- 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.
