This is the solution for the famous fake coin problem in C++ with two differnet algorithms. The problem is if there is a pile of coins with a set number coins and one coin which either weighs more or less than the rest and goal is to find the fake coin as fast as possible. Divide & Conquer and Bruteforce are used for this.
To Use: clone, change variables if needed and enjoy.