Here we compare Fibonacci algorithm implemented in C++ but in different programming styles, in order to understand which style compiles to shorter binary code and works faster. If you can imagine some other way how this algorithm could be implemented in C++, don't hesitate to submit a pull request.

To build it just run:

$ make

The result will be in summary.txt file.

To make test more intensive and run five times more cycles, do this:

$ make FACTOR=5

To analyze the quality of the code in this repo and make sure there are no hidden defects, run all static analyzers and style checkers:

$ make sa

You need to have Clang, Make, Clang-Tidy, and cpplint installed.