1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.

question about acquaintance

Discussion in 'C' started by abnewusers, Feb 15, 2012.

  1. abnewusers

    abnewusers New Member

    Joined:
    Feb 15, 2012
    Messages:
    2
    Likes Received:
    0
    Trophy Points:
    0
    I have been asked to implement such question:

    Given a data file like csv, two columns in it, each line contains “calling No, called No”. Each line actually represents a phone conversion by two person. If A talks to B, and C talks to B, then A and B are friends, A and C are acquaintances. I am asked to look for the person
    who has the most acquaintances.
     
  2. xpi0t0s

    xpi0t0s Mentor

    Joined:
    Aug 6, 2004
    Messages:
    3,012
    Likes Received:
    203
    Trophy Points:
    0
    Occupation:
    Senior Support Engineer
    Location:
    England
    Seems easy enough. Where are you stuck? Do you understand the requirements?
    Have you tried doing it on paper to get an idea of what algorithm you might use?
     

Share This Page