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

Anggoro  Wisnu.

Главная
→
EBSCO eBook (только для КФУ)
→
Полнотекстовая коллекция книг EBSCO eBook
→
Просмотр элемента

dc.contributor.author	Anggoro Wisnu.
dc.date.accessioned	2024-01-26T21:36:57Z
dc.date.available	2024-01-26T21:36:57Z
dc.date.issued	2018
dc.identifier.citation	Anggoro. C++ Data Structures and Algorithms: Learn how to write efficient code to build scalable and robust applications in C++. - Birmingham: Packt Publishing, 2018 - 1 online resource (314 pages) - URL: https://libweb.kpfu.ru/ebsco/pdf/1801030.pdf
dc.identifier.isbn	9781788831970
dc.identifier.isbn	1788831977
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/178484
dc.description	Interpolation search.
dc.description.abstract	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.
dc.description.tableofcontents	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.
dc.description.tableofcontents	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.
dc.description.tableofcontents	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.
dc.description.tableofcontents	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.
dc.description.tableofcontents	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.
dc.language	English
dc.language.iso	en
dc.publisher	Birmingham Packt Publishing
dc.subject.other	C++ (Computer program language)
dc.subject.other	Data structures (Computer science)
dc.subject.other	Computer algorithms.
dc.subject.other	Algorithms.
dc.subject.other	C++ (Langage de programmation)
dc.subject.other	Structures de données (Informatique)
dc.subject.other	Algorithmes.
dc.subject.other	algorithms.
dc.subject.other	COMPUTERS -- Programming Languages -- C#.
dc.subject.other	Data structures (Computer science)
dc.subject.other	C++ (Computer program language)
dc.subject.other	Computer algorithms.
dc.subject.other	Electronic books.
dc.subject.other	Electronic books.
dc.title	C++ Data Structures and Algorithms: Learn how to write efficient code to build scalable and robust applications in C++.
dc.type	Book
dc.description.pages	1 online resource (314 pages)
dc.collection	Электронно-библиотечные системы
dc.source.id	EN05CEBSCO05C1181