C++ Data Structures and Algorithms: Learn how to write efficient code to build scalable and robust applications in C++ by Wisnu Anggoro | barcode:9781788835213 | source:'9781788835213-right-three-quarter.jpg

C++ Data Structures and Algorithms: Learn how to write efficient code to build scalable and robust applications in C++ by Wisnu Anggoro

$63.99
Sale price  $63.99 Regular price 
Skip to product information
C++ Data Structures and Algorithms: Learn how to write efficient code to build scalable and robust applications in C++ by Wisnu Anggoro | barcode:9781788835213 | source:'9781788835213-right-three-quarter.jpg

Book Condition: Used — Like New

C++ Data Structures and Algorithms: Learn how to write efficient code to build scalable and robust applications in C++ by Wisnu Anggoro

$63.99
Sale price  $63.99 Regular price 
Author: Wisnu Anggoro
ISBN: 9781788835213

Learn how to build efficient, secure and robust code in C++ by using data structures and algorith,s - 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++ has come a long way and is now adopted in several contexts. Its key strengths are its software infrastructure and resource-constrained applications, including desktop applications, servers, and performance-critical applications, not to forget its importance in game programming. This book will be your companion as it takes you through implementing classic data structures and algorithms in C++, helping you get up and running as a confident C++ programmer. The book begins with an introduction to C++ data structures and algorithms while also covering essential language constructs. You will learn how to store data using linked lists, arrays, stacks and queues. You will also learn how to implement sorting algorithms like Insertion sort, Selection sort, Bubble sort, Heap sort, Quick sort, Merge sort and Radix sort. The book discusses how to implement searching algorithms like linear search, Binary search, Jump search, Interpolation search, Exponential search and so on. You will learn how to attain high performance by implementing algorithms to string data types and implement hash structure in algorithm design. The book will be looking into algorithm analysis such as Brute Force algorithms, Greedy algorithms, Divide & Conquer algorithms, Dynamic Programming, and Backtracking. Read more

You may also like