The Design and Analysis of Algorithm for the Counterfeit Coins Problem

• Main Authors: Li-Chung Lee, 李立中
• Other Authors: 林順喜
• Format: Others
• Language: zh-TW
• Published: 2002
• Online Access: http://ndltd.ncl.edu.tw/handle/43191910786827854125

碩士 === 國立臺灣師範大學 === 資訊教育研究所 === 90 === The counterfeit coin problem is a well-known problem. There are some people who have tried to make the problem more challenging by adding more constraints on the problem. There are also a lot of people presenting different algorithms for variants of the problem. In this paper, we will propose some algorithms and strategies to solve some sort of the counterfeit coin problems, including the 2-counterfeit coins problem with unknown weight, and the k-counterfeit coins with known weight, where k  3. In addition, we will provide the analysis of the algorithms for these counterfeit coins problems. According to the analysis, we will know the theoretical lower bound of the numbers of the weighting when we are looking for the counterfeit coins in a mass of coins. Thus, we will know which strategy of the problem might be further improved.