Buy C++11 Algorithms Volume 1(second Edition) by Aditya Kant Sharma
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer programming / software engineering > Programming and scripting languages: general > C++11 Algorithms Volume 1(second Edition): Using and Extending C++11, Boost and Beyond
18%
C++11 Algorithms Volume 1(second Edition): Using and Extending C++11, Boost and Beyond

C++11 Algorithms Volume 1(second Edition): Using and Extending C++11, Boost and Beyond


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

This book is vital to understand algorithms newly introduced in C++11 with the help of practical examples illustrating concepts, variations, customizations and correctness with deep insight into internals with primary focus on effective usage. 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. Algorithms This book(Volume 1) illustrates following algorithms: Numeric Algorithms Simulating for-loop iteration with iota Customizing iota Return Type of iota Compile Time iota Interesting variations of iota Quantifier Algorithms Universal Quantifier("Predicate Satisfiability For All") Non-Existential Quantifier("Predicate Satisfiability For None") Existential Quantifier("Predicate Satisfiability For Some") Unique Quantifier("Predicate Satisfiability For One") Partition Algorithms Predicate Based Rearrangements Partition Structure Validation Bisection Algorithm Group Partitions Recommended Approach 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 The C++ Standard Library, Second Edition: A Tutorial and Reference by Nicolai M. Josuttis handy for gentle introduction to C++11 algorithms followed by diving into respective sections of our book for detailed information. In-depth treatment of foundational aspect of C++11 algorithms is covered in another book published by us Foundation of Algorithms in C++11, Volume 1(Third Edition) : Using and Extending C++11, Boost and Beyond.

About the Author :
Chandrashekhar Kumar holds a degree in Integrated M.Sc.(5 yrs) in Physics from IIT Kanpur. He has been programming in C++ since last 13 years. He loves to hack gcc, gdb, valgrind, clang, boost, TeX and pours inside the works of Knuth. Aditya Kant Sharma holds a B.Tech. degree from MITS-G. He has been programming in C++ since last 9 years. He loves to dive inside the internals of C++, Templates hijacking, STL, Boost, Loki, Design Patterns, LaTeX. He is at the forefront of spearheading ruminations on C++11 and beyond.


Best Sellers


Product Details
  • ISBN-13: 9781482360233
  • Publisher: Createspace
  • Publisher Imprint: Createspace
  • Height: 229 mm
  • No of Pages: 204
  • Spine Width: 11 mm
  • Weight: 281 gr
  • ISBN-10: 1482360233
  • Publisher Date: 04 Feb 2013
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Sub Title: Using and Extending C++11, Boost and Beyond
  • Width: 152 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
C++11 Algorithms Volume 1(second Edition): Using and Extending C++11, Boost and Beyond
Createspace -
C++11 Algorithms Volume 1(second Edition): Using and Extending C++11, Boost and Beyond
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

C++11 Algorithms Volume 1(second Edition): Using and Extending C++11, Boost and Beyond

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!