Grokking_Data_Structures.pdf

(17236 KB) Pobierz
Marcello La Rocca
Foreword by
Daniel Zingaro
Topics Covered in This Book
Data Structure
Array
Chapter
2, 3, 5
Applications
•
Arrays have countless applications. Use them
whenever you need to store a collection of items
and efficiently retrieve them by their position.
Arrays are also a building block used to
implement more advanced data structures such
as stacks, queues, graphs, hash tables, and so on.
Keep a set of items and iterate through it
regardless of the order.
Balanced binary search trees are mainly used to
store sorted datasets and provide worst-case
logarithmic-time operations to insert, delete, and
search elements and to find the predecessor and
successor of any element.
As associative arrays, they solve the problem of
storing and retrieving items by key instead of by
position (like regular arrays).
Modeling arbitrarily complex relationships, such
as social networks, transportation networks,
computer networks, circuit design, game design,
biological systems, and so on.
Recommendation systems, web crawlers, search
engines.
Graph databases.
Graph neural networks.
Counting elements, removing duplicates, routers,
CDNs, firewalls, browsers.
Symbol tables in compilers, garbage collectors,
DB indexing, and so on.
Heapsort sorting algorithm. See also
Priority
queue.
•
Bag
Binary search
tree
7
11
•
•
Dictionary
12
•
Graph
13
•
•
•
•
Hash table
12
•
•
Heap
10
•
Grokking Data Structures
Grokking
Data
Structures
Marcello La Rocca
Foreword by Daniel Zingaro
MANNING
S
helter
I
Sland

Plik z chomika:

Inne pliki z tego folderu:

Inne foldery tego chomika:

Zgłoś jeśli naruszono regulamin