Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
C++ Data Structures and Algorithms

You're reading from   C++ Data Structures and Algorithms Learn how to write efficient code to build scalable and robust applications in C++

Arrow left icon
Product type Paperback
Published in Apr 2018
Publisher Packt
ISBN-13 9781788835213
Length 322 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Wisnu Anggoro Wisnu Anggoro
Author Profile Icon Wisnu Anggoro
Wisnu Anggoro
Arrow right icon
View More author details
Toc

Table of Contents (10) Chapters Close

1. Learning Data Structures and Algorithms in C++ FREE CHAPTER 2. Storing Data in Lists and Linked Lists 3. Constructing Stacks and Queues 4. Arranging Data Elements Using a Sorting Algorithm 5. Finding out an Element Using Searching Algorithms 6. Dealing with the String Data Type 7. Building a Hierarchical Tree Structure 8. Associating a Value to a Key in a Hash Table 9. Implementation of Algorithms in Real Life 10. Other Books You May Enjoy

Implementation of Algorithms in Real Life

So far, we have learned how to construct data structures and implement sorting and searching algorithms. In this final chapter, we are going to discuss the implementation of algorithms in real life. Here are the algorithms we are going to discuss:

  • Greedy algorithms
  • Divide and conquer algorithms
  • Dynamic programming
  • Brute-force algorithms
  • Randomized algorithms
  • Backtracking algorithms
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at AU $24.99/month. Cancel anytime