Foundation of Algorithms in C++11, Volume 1: Using and Extending C++11, Boost And Beyond (Algocoders Series)

algocoders.com

Revised edition of this book is available at:
amazon.com/Foundation-Algorithms-Volume-Revised-Edition/dp/1481965549/

This book or booklet is an attempt to voice our understanding of foundation of algorithms newly introduced in C++11 from programmers' perspective who wish to keep themselves abreast with latest advent in C++ and beyond, but quite often than less, find themselves amidst a myriad of disconnecting information, simply due to sheer size of tremendous information available at hands reach, leading to a vast array of tips n techniques. Nonetheless, when it comes to applying same to their day-to-day problems, they end up struggling a lot to find the apt one.

This is the very first of this series which is out as promised above! We have adopted a top-down approach to instill our notes in a cohesive manner.

The style is pedagogical : we took an algorithm, newly introduced in C++11, looked at its usage, patterns, limitations, corner-cases, preconditions, post-conditions, constraints etc. while keeping a close eye on the interface, its possible evolution in ongoing works like the Origin C++ Libraries by Andrew Sutton, Contract++, A Concept Design of the STL by Bjarne Stroustrup et al. and other efforts to port boost libraries to C++11 as well as works at libcxx and libstdc++ with focus on C++11.

We tried to present a coherent approach to address the needs of programmers like us, who are keenly interested to apply these at work, with little or less risk, without indulging deep into the internals of intermediate evolution.

Table of Contents : algocoders.com/sites/default/files/toc_foa_revised.pdf
Sample Chapter   : algocoders.com/sites/default/files/chapter1_foa_revised.pdf
Errata                  : algocoders.com/sites/default/files/errata_foa_old_edition.pdf