Search icon
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletters
Free Learning
Arrow right icon
C++ Data Structures and Algorithms

You're reading from  C++ Data Structures and Algorithms

Product type Book
Published in Apr 2018
Publisher Packt
ISBN-13 9781788835213
Pages 322 pages
Edition 1st Edition
Languages
Author (1):
Wisnu Anggoro Wisnu Anggoro
Profile icon Wisnu Anggoro

Table of Contents (16) Chapters

Title Page
Copyright and Credits
Packt Upsell
Contributors
Preface
1. Learning Data Structures and Algorithms in C++ 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 1. Other Books You May Enjoy Index

QA section


  • Can we sort the left sublist and right sublist from the partition method in quick sort using other sorting algorithms?
  • Suppose we have an array which consists of {4, 34, 29, 48, 53, 87, 12, 30, 44, 25, 93, 67, 43, 19, 74}. What sorting algorithm will give you the fastest time performance?
  • Why can merge sort and quick sort have O(N • log N) for their time complexity?
  • What sorting algorithm is similar to arranging a hand of poker cards?
  • What is the best sorting algorithm if we are going to sort an array which consists of {293, 21, 43, 1024, 8, 532, 70, 8283}?
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 €14.99/month. Cancel anytime}