First time here? Checkout the FAQ!
0 votes

Q: There are n  white dots and  n black dots, equally spaced in a line. We want to each white dot with some black dot in on-to-one fashion with a minimum total length of the wire. (See diagram above). Greedy algo. gives optimal solution for..

A) Only i

B) Only ii

C) Both

D) None


How to approach to such type of questions ?

asked in Algorithms by Loyal (2.5k points)  
edited by | 209 views

Please log in or register to answer this question.

Related questions

Top Users Mar 2017
  1. rude

    4018 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2606 Points

  5. Debashish Deka

    2092 Points

  6. 2018

    1414 Points

  7. Vignesh Sekar

    1318 Points

  8. Bikram

    1218 Points

  9. Akriti sood

    1166 Points

  10. Sanjay Sharma

    1004 Points

Monthly Topper: Rs. 500 gift card

21,439 questions
26,753 answers
22,929 users