Exhaustive Search

The Exhaustive Search Algorithm is a technique that has low efficiency.

Exhaustive Search goes through all possibilities.

Theoretically, Exhaustive Search has the ability to find the optimum solution.

However, time is limited in reality.

One-max problem

The one-max problem is a basic problem.

Given a bit string of 0's and 1's, the aim is to find a bit string which contains the most 1's.

Open terminal

    make

Run directly in the terminal by typing the following:

 #./main [algo] [runs] [iter] [bits] [filename]
 ./main es 1 20000 100 ""

Or if you want to run multiple times, just by opening the "search.sh" and add whatever you want and run by typing
```
 ./search.sh
```

in the terminal.

You can change the iteration block by modifying

    const int block=100;

in "execute.hpp".