There are 'n' number of detectives..each one knows an information, how many minimum calls should they make so all the detectives know all the n number of information ? My answer: I came up with 2n3 (that is, n1 + n2) solution where a detective calls n1 other detectives and shares information mutually (in this way the last detective and the first has all the information). Then the remaining n2 detectives who doesn't have the whole data calls either the first detective or the last to gain the remaining information. asked 28 Sep '13, 23:31

@saikiranboga11 : Hello , sorry my earlier comment was wrong so I have deleted it. answered 29 Sep '13, 07:20
