RelyOnTheTruth's blog

By RelyOnTheTruth, history, 19 months ago, In English,

You have an array of diameters representing the size of different circles arranged in non increasing order, we want to arrange those circles such that the maximum distance between any two circles is minimized. Note that: 1-no two circles can overlap or coincide. 2-the only way valid to arrange them is to make their borders touch. What is the best algorithm for those kind of problems ? and how to prove the answer ?

Read more »

  • Vote: I like it
  • +8
  • Vote: I do not like it