{'fraction_non_alphanumeric': 0.01871657754010695, 'fraction_numerical': 0.00267379679144385, 'mean_word_length': 4.3120567375886525, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Identification of a Counterfeit Coin

This paper analyzes a technique used in finding a distinct counterfeit coin in a set of coins of the same denomination. If counterfeit the coin exists, this coin is either heavier or lighter than any of the other coins in the set. The set of coins can contain any permutation of coins while the set must contain at least 3 coins. The algorithm described in this paper presents an algorithm for a general n coin problem with n ≥ 3. The means to evaluate the problem is accomplished by counting how many times a weighing function must be used to find the counterfeit coin. In this paper, we present an algorithm with the worst case time complexity is Θ(logn). This is achieved with a space complexity of Θ(logn).