The book<font>  &quot;</font><a href="http://www.algocoders.com/" target="_blank">C++11 Algorithms Volume 1 : Using and Extending C++11, Boost and Beyond</a>&quot; is <font>published.</font><br><div class="gmail_quote"><font><span><span style="font-weight:normal"></span></span></font><br>

<a href="http://www.algocoders.com/sites/default/files/toc_c%2B%2B11algorithms_vol1.pdf" target="_blank"><b>Table of Contents: http://www.algocoders.com/sites/default/files/toc_c%2B%2B11algorithms_vol1.pdf</b></a><br><a href="http://www.algocoders.com/sites/default/files/chapter1_c%2B%2B11algorithms_vol1.pdf" target="_blank"><b>Sample Chapter: http://www.algocoders.com/sites/default/files/chapter1_c%2B%2B11algorithms_vol1.pdf</b></a><br>

<a href="http://www.algocoders.com/sites/default/files/toc_c%2B%2B11algorithms_vol1.pdf" target="_blank"><b></b></a><div class="gmail_quote"><div>
<br><a href="http://www.amazon.com/11-Algorithms-Volume-Extending-Beyond/dp/1482083396/" target="_blank">@Amazon : www.amazon.com/11-Algorithms-Volume-Extending-Beyond/dp/1482083396/</a>
<br><a href="http://pothi.com/pothi/book/chandra-shekhar-kumar-c11-algorithms-volume-1" target="_blank">@Pothi.com (Indian Edition) : http://pothi.com/pothi/book/chandra-shekhar-kumar-c11-algorithms-volume-1</a><br>
<br></div><p><b></b></p><p><u><b>Description</b></u><br>This book is vital to understand <b>algorithms</b> newly introduced in <b>C++11</b> with the help of practical examples illustrating <b>concepts</b>, <b>variations</b>, <b>customizations</b> and <b>correctness</b> with deep insight into internals with primary focus on <b>effective usage</b>.
 This book can be read by anyone having some experience in any higher 
level programming. Beginners in C++ will be able to learn basic concepts
 of C++11 algorithms with practical examples. Intermediate programmers 
in C++ will learn foundational aspect of C++11 algorithms in a pragmatic
 way. Expert programmers(aka C++ hackers) can enjoy interesting 
variations leading to future of C++11 algorithms(aka C++1y), Boost and 
beyond. <br></p><div><div><img src="https://mail.google.com/mail/images/cleardot.gif"></div></div><div>This book(<b>Volume 1</b>) illustrates following algorithms: <br>
 <ul><li><b>Numeric Algorithms</b></li><ul><li>Simulating for-loop iteration with iota</li><li>Customizing iota</li><li>Return Type of iota</li><li>Compile Time iota</li><li>Interesting variations of iota</li></ul><li><b>Quantifier Algorithms</b></li>

<ul><li>Universal Quantifier(<i>Predicate Satisfiability For All</i>)</li><li>Non-Existential Quantifier(<i>Predicate Satisfiability For None</i>)</li><li>Existential Quantifier(<i>Predicate Satisfiability For Some</i>)</li>

<li>Unique Quantifier(<i>Predicate Satisfiability For One</i>)</li></ul><li><b>Partition Algorithms</b></li><ul><li>Predicate Based Rearrangements</li><li>Partition Structure Validation</li><li>Bisection Algorithm</li><li>

Group Partitions</li></ul></ul><b>Recommended Approach</b> <br>Though this book can be read without 
reference to any other source, still we recommend our readers to keep a 
copy of the famous book <br><b>The C++ Standard Library, Second Edition : A Tutorial and Reference by Nicolai M. Josuttis</b>
 handy for gentle introduction to C++11 algorithms followed by diving 
into respective sections of our book for detailed information. <br><br>In-depth treatment of foundational aspect of C++11 algorithms is covered in another book published by us <br><a href="http://www.amazon.com/Foundation-Algorithms-Volume-Revised-Edition/dp/1481965549/" target="_blank">Foundation of Algorithms in C++11, Volume 1(Revised Edition) : Using and Extending C++11, Boost and Beyond.</a><br>


<br>For more details, please visit the link : 
<br><a href="http://www.algocoders.com/article/books" target="_blank">http://www.algocoders.com/article/books</a>
<br>
<br>Enjoy Reading !
<br>
<br>Cheers,
<br>Algocoders
<br>
<br><a href="http://www.algocoders.com" target="_blank">http://www.algocoders.com</a><br><a href="mailto:paranoids@algocoders.com" target="_blank">paranoids@algocoders.com</a><br>
</div></div>
</div><br>