On a New Universal Algorithm for Coins Problem and Its Realization

摘要

This paper determines the shortest period of time for picking out a bad one from n(random quantity) coins and measuring its weight. The paper also offers a universal method to find out which one is bad among n coins and make sure of its weight with a balance in the shortest time, and the method is realized and tested with C++. The testing results show that the algorithm only requires as small space as that of simulating coins sequence, and that it needs one more comparison when the number of coins triples. The time and space needed minimize theoretically. The difference of before algorithm is it can judge if a bad coin in n coins.