Цитаты из книги Грокаем структуры данных

We will then talk about an important class of abstract data types—containers—which will be our focus in the next five chapters.

A singly linked list is a linked list with a single link per node, pointing to the next element in the list.

A linked list is a sequence of linked nodes, where each node is itself a small data structure that stores a single value and a link to the next node.

In our case, for an unsorted array, we just have to bite the bullet and scan the whole array until we find a match (or don’t).

With sorted arrays, you have faster search, but you also have an extra cost to keep them sorted. Therefore, they should be preferred when there is a high read-to-write ratio (many more calls to the binary_search method than to insert and delete).

Swapping the entry to be removed with the rightmost one in the array, and then deleting it
<…>
The last element will be outside the populated chunk (a word of caution: array loitering).

Python, the programming language we use in this book, natively provides lists, a dynamically sized kind of array that allows any data type for its elements.

It would already be painful to create 24 different variables by hand,

We will begin our journey to the land of data structures with arrays

what if she later needs to find even more distant relationships such as “friend of a friend of a friend” or the six degrees of Kevin Bacon? Unfortunately, an SQL database doesn’t seem to support everything she needs.
Later in this book, you’ll learn that graphs would help Sandra tame highly relational data and that she could use the breadth-first search algorithms to explore indirect friend relationships.

Have you ever heard of Maslow’s hammer, also known as the law of the instrument? It states that if your tool belt only has a hammer, you will be tempted to treat everything as a nail.
<…>
A hammer is unlikely to help if you need to tighten a bolt.

Data structures are the building blocks of computer science. They are important because they help organize data, solve difficult problems, improve efficiency, optimize memory usage, and avoid security risks.

Some data structures are specifically designed to allow the efficient execution of certain algorithms, such as hash tables for key-based search.

While you wait your turn, you are literally in another data structure, a queue!

When you go shopping, you fill your physical cart with items you want to buy: there it is, a container. But which container in particular? I don’t want to spoil it for you, but you’ll be able to tell after reading this book.

In this chapter welcome to this book

we will look at two most common ways to implement a graph: the adjacency list and the adjacency matrix.

A graph that has no cycles is called acyclic
<…>
A simple undirected acyclic graph that is not connected is called a forest.

“What is a graph?”

you must remember that in data structures, as in life, there is no rose without a thorn (but many a thorn without a rose).