Электронный каталог

DDC 005.133
A 57
Anggoro, Wisnu.
    C++ Data Structures and Algorithms : : Learn how to write efficient code to build scalable and robust applications in C++. / Wisnu. Anggoro. - Birmingham : : Packt Publishing,, 2018. - 1 online resource (314 pages). - URL: https://library.dvfu.ru/lib/document/SK_ELIB/19EAD0E1-760F-43E1-B210-8CFCDA1C7D6D . - ISBN 9781788831970 (electronic bk.). - ISBN 1788831977 (electronic bk.)
Interpolation search. Print version record.
Параллельные издания: Print version: : Anggoro, Wisnu. C++ Data Structures and Algorithms : Learn how to write efficient code to build scalable and robust applications in C++. - Birmingham : Packt Publishing, ©2018
    Содержание:
Cover; Title Page; Copyright and Credits; Packt Upsell; Contributors; Table of Contents; Preface; Chapter 1: Learning Data Structures and Algorithms in C++; Technical requirements; Introduction to basic C++; Creating your first code in C++; Enhancing code development experience with IDE; Defining the variables using fundamental data types; Controlling the flow of the code; Conditional statement; Loop statement; Leveraging the variable capability using advanced data types; Developing abstract data types; Applying C++ classes to build user-defined ADTs; Playing with templates.
Function templatesClass templates; Standard Template Library; Analyzing the algorithm; Asymptotic analysis; Worst, average, and best cases; Big Theta, Big-O, and Big Omega; Recursive method; Amortized analysis; Summary; QA section; Further reading; Chapter 2: Storing Data in Lists and Linked Lists; Technical requirements; Getting closer to an array; Building a List ADT; Fetching an item in the List; Inserting an item into the List ADT; Finding out the index of a selected item in the List ADT; Removing an item from the List ADT; Consuming a List ADT; Introduction to node.
Building a Singly Linked List ADTFetching an item in the LinkedList class; Inserting an item in the LinkedList class; Getting the index of the selected item in the LinkedList; Removing an item from the LinkedList ADT; Consuming the LinkedList ADT; Building the Doubly Linked List ADT; Refactoring the Node data type; Refactoring several operations in the LinkedList ADT; Removing an element; Inserting an element; Consuming the DoublyLinkedList ADT; Applying List and LinkedList using STL; std::vector; std::list; Summary; QA section; Further reading; Chapter 3: Constructing Stacks and Queues.
Technical requirementsBuilding a Stack ADT; Fetching the item's value in the Stack ADT; Pushing the items of the Stack ADT; Popping the items from the Stack ADT; Consuming a Stack ADT; Another example of Stack ADT implementation; Building a Queue ADT; Getting a value from Queue ADT; Inserting an element into the Queue ADT; Removing an element from the Queue ADT; Consuming the Queue ADT; Building a Deque ADT; Fetching a value from a Deque; Enqueueing an element into the Deque ADT; Dequeuing an element from the Deque ADT; Consuming the Deque ADT; Summary; QA section; Further reading.
Chapter 4: Arranging Data Elements Using a Sorting AlgorithmTechnical requirements; Bubble sort; Selection sort; Insertion sort; Merge sort; Quick sort; Counting sort; Radix sort; Summary; QA section; Further reading; Chapter 5: Finding out an Element Using Searching Algorithms; Technical requirements; Linear search; Developing a linear search algorithm; Implementing the linear search algorithm; Binary search; Developing binary search algorithm; Implementing binary search algorithm ; Ternary search; Developing ternary search algorithm; Applying the ternary search algorithm.

Anggoro, Wisnu. C++ Data Structures and Algorithms : [Электронный ресурс] : Learn how to write efficient code to build scalable and robust applications in C++. / Wisnu. Anggoro, 2018. - 1 online resource (314 pages) с. (Введено оглавление)