C++ Data Structures and Algorithms

C++ Data Structures and Algorithms: Build effective, maintainable and readable code in C++ By 作者: Wisnu Anggoro ISBN-10 书号: 1788835212 ISBN-13 书号: 9781788835213 出版日期: 2018-06-11 pages 页数: 409 $44.99 Book Description to Finelybook sorting 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. 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 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 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 Authors Wisnu Anggoro Wisnu Anggoro is a Microsoft Certified Professional in C# programming and an experienced C/C++ developer. He has also authored the books Boost.Asio C++ Network Programming – Second Edition and Functional C# by Packt. He has been programming since he was in junior high school, which was about 20 years ago, and started developing computer applications using the BASIC programming language in the MS-DOS environment. He has solid experience in smart card programming, as well as desktop and web application programming, including designing, developing, and supporting the use of 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 innovation and technology for smart cards. He can be reached through his email at wisnu@anggoro.net