Suppose you are given n number of coins, in that one coin is faulty, its weight is less than standard coin weight. To find the faulty coin in a list using proper searching method. What will be the complexity of searching method.

1. Name the coins as 1, 2, 3, 4 …..N.
2. We know that one coin is faulty as its weight is less than the standard coin weight.
3. Considering best outcome of balance, we can group the coins in two different ways, [(1, 2), (3, 4), ((N-1), N)] or [(1,…..((N/2)-1) and ((N/2),……N))]. …