C++ Data Structures and Algorithms: Learn how to write efficient code to build scalable and robust applications in C++ - Brossura

Anggoro, Wisnu

Brossura

ISBN 10: 1788835212 ISBN 13: 9781788835213

Casa editrice: Packt Publishing, 2018

Riassunto

Learn how to build efficient, secure and robust code in C++ by using data structures and algorithms - the building blocks of C++

Key Features

• Use data structures such as arrays, stacks, trees, lists, and graphs with real-world examples
• Learn the functional and reactive implementations of the traditional data structures
• Explore illustrations to present data structures and algorithms, as well as their analysis, in a clear, visual manner

Book Description

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.

What you will learn

• Know how to use arrays and lists to get better results in complex scenarios
• Build enhanced applications by using hashtables, dictionaries, and sets
• Implement searching algorithms such as linear search, binary search, jump search, exponential search, and more
• Have a positive impact on the efficiency of applications with tree traversal
• Explore the design used in sorting algorithms like Heap sort, Quick sort, Merge sort and Radix sort
• Implement various common algorithms in string data types
• Find out how to design an algorithm for a specific task using the common algorithm paradigms

Who This Book Is For

This book is for developers who would like to learn the Data Structures and Algorithms in C++. Basic C++ programming knowledge is expected.

Table of Contents

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 sorting algorithm
5. Finding out an element using searching algorithm
6. Dealing with strings
7. Building hierarchical tree structure
8. Associating a value to a key in hash table
9. Designing an algorithm

Su questo libro

L'autore

Wisnu Anggoro is a Microsoft Certified Professional in C# programming and an experienced C/C++ developer. He has also authored three books, Learning C++ Functional Programming, Functional C#, and Boost.Asio C++ Network Programming - Second Edition, published by Packt. He has been programming since he was in junior high school (about 20 years ago) and started developing computer applications using the BASIC programming language in the MS-DOS environment. He has a solid experience of smart card programming as well as desktop and web application programming, such as designing, developing, and supporting live use applications for SIM Card Operating System Porting, personalization, PC/SC communication, and other smart card applications that require the use of C# and C/C++. He is currently a senior smart card software engineer at CIPTA, an Indonesian company that specializes in the innovation and technology of smart cards.

Dettagli dell'edizione

• Editore: Packt Publishing
• Data di pubblicazione: 2018
• Lingua: Inglese
• ISBN 10: 1788835212
• ISBN 13: 9781788835213
• Rilegatura: Copertina flessibile
• Numero di pagine: 322
• Contatto del produttore: non disponibile
• Persona responsabile: non disponibile