Book Image

C++ Data Structures and Algorithms

By : Wisnu Anggoro
5 (1)
Book Image

C++ Data Structures and Algorithms

5 (1)
By: Wisnu Anggoro

Overview of this book

C++ is a general-purpose programming language which has evolved over the years and is used to develop software for many different sectors. This book will be your companion as it takes you through implementing classic data structures and algorithms to help you get up and running as a confident C++ programmer. We begin with an introduction to C++ data structures and algorithms while also covering essential language constructs. Next, we will see how to store data using linked lists, arrays, stacks, and queues. Then, we will learn how to implement different sorting algorithms, such as quick sort and heap sort. Along with these, we will dive into searching algorithms such as linear search, binary search and more. Our next mission will be to attain high performance by implementing algorithms to string datatypes and implementing hash structures in algorithm design. We'll also analyze Brute Force algorithms, Greedy algorithms, and more. By the end of the book, you'll know how to build components that are easy to understand, debug, and use in different applications.

Related Content you might be interested in

Current Title:

Small book image
C++ Data Structures and Algorithms
Wisnu Anggoro
Apr, 2018 | 322 pages
Small book image
Hands-On Data Structures and Algorithms with Python – Third Edition
Dr Basant Agarwal
Jul, 2022 | 496 pages
Small book image
Learning JavaScript Data Structures and Algorithms
Loiane Groner
Apr, 2018 | 426 pages
Small book image
PHP 7 Data Structures and Algorithms
Mizanur Rahman
May, 2017 | 340 pages
Table of Contents (16 chapters)
Title Page
Title Page
Copyright and Credits
Copyright and Credits
Packt Upsell
Packt Upsell
Contributors
Contributors
Preface
Preface
Free Chapter
1
Learning Data Structures and Algorithms in C++
Learning Data Structures and Algorithms in C++
Technical requirements
Introduction to basic C++
Developing abstract data types
Analyzing the algorithm
Summary
QA section
Further reading
2
Storing Data in Lists and Linked Lists
Storing Data in Lists and Linked Lists
Technical requirements
Getting closer to an array
Building a List ADT
Introduction to node
Building a Singly Linked List ADT
Building the Doubly Linked List ADT
Applying List and LinkedList using STL
Summary
QA section
Further reading
3
Constructing Stacks and Queues
Constructing Stacks and Queues
Technical requirements
Building a Stack ADT
Building a Queue ADT
Building a Deque ADT
Summary
QA section
Further reading
4
Arranging Data Elements Using a Sorting Algorithm
Arranging Data Elements Using a Sorting Algorithm
Technical requirements
Bubble sort
Selection sort
Insertion sort
Merge sort
Quick sort
Counting sort
Radix sort
Summary
QA section
Further reading
5
Finding out an Element Using Searching Algorithms
Finding out an Element Using Searching Algorithms
Technical requirements
Linear search
Binary search
Ternary search
Interpolation search
Jump search
Exponential search
Sublist search
Summary
QA section
Further reading
6
Dealing with the String Data Type
Dealing with the String Data Type
Technical requirement
String in C++
Playing with words
Constructing a string from binary digits
Subsequence string
Pattern searching
Summary
QA section
Further reading
7
Building a Hierarchical Tree Structure
Building a Hierarchical Tree Structure
Technical requirements
Building a binary tree ADT
Building a binary search tree ADT
Building a balanced BST (AVL) ADT
Building a binary heap ADT
Summary
QA section
Further reading
8
Associating a Value to a Key in a Hash Table
Associating a Value to a Key in a Hash Table
Technical requirement
Getting acquainted with hash tables
Implementing a separate chaining technique
Implementing the open addressing technique
Summary
QA section
Further reading
9
Implementation of Algorithms in Real Life
Implementation of Algorithms in Real Life
Technical requirements
Greedy algorithms
Divide and conquer algorithms
Dynamic programming
Brute-force algorithms
Randomized algorithms
Backtracking algorithms
Summary
QA section
Further reading
Other Books You May Enjoy
Other Books You May Enjoy
Leave a review - let other readers know what you think
Index
Index

Building a Queue ADT

A queue data type is a list with some restrictions to the effect that the inserting operation (enqueue) can only be performed from one side (called the back) and the removing operation (dequeue) can only be performed from the other side (called the front). Similar to the Stack data type, we can develop the Queue data type by using the LinkedList data type. For the Enqueue() operation, we can adopt the InsertTail() operation in the LinkedList data type since we are going to insert an element from the back, which is similar to the Tail node in the LinkedList data type. Also, for the Dequeue() operation, we will use the implementation of the RemoveHead() operation in the LinkedList data type. The Queue data type is also known as the First In First Out (FIFO) data type since the element that is inserted from the back of Queue will travel to the front side before it can be removed. Let's take a look at the following diagram showing the queue:

As we can see in the preceding...

Previous Section
End of Section 4
Next Section