Skip to content

Commit 5b64117

Browse files
trekhlebtrekhleb
committed
Fex READMEs.
1 parent d0c359e commit 5b64117

3 files changed

Lines changed: 31 additions & 28 deletions

File tree

‎src/data-structures/hash-table/README.md‎

Lines changed: 11 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -5,18 +5,19 @@ _Read this in other languages:_
55
[_Русский_](README.ru-RU.md),
66
[_日本語_](README.ja-JP.md),
77
[_Français_](README.fr-FR.md),
8-
[_Português_](README.pt-BR.md), [_한국어_](README.ko-KR.md)
9-
10-
In computing, a **hash table** (hash map) is a data
11-
structure which implements an *associative array*
12-
abstract data type, a structure that can *map keys
13-
to values*. A hash table uses a *hash function* to
14-
compute an index into an array of buckets or slots,
8+
[_Português_](README.pt-BR.md),
9+
[_한국어_](README.ko-KR.md)
10+
11+
In computing, a **hash table** (hash map) is a data
12+
structure which implements an *associative array*
13+
abstract data type, a structure that can *map keys
14+
to values*. A hash table uses a *hash function* to
15+
compute an index into an array of buckets or slots,
1516
from which the desired value can be found
1617

17-
Ideally, the hash function will assign each key to a
18-
unique bucket, but most hash table designs employ an
19-
imperfect hash function, which might cause hash
18+
Ideally, the hash function will assign each key to a
19+
unique bucket, but most hash table designs employ an
20+
imperfect hash function, which might cause hash
2021
collisions where the hash function generates the same
2122
index for more than one key. Such collisions must be
2223
accommodated in some way.

‎src/data-structures/heap/README.md‎

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -6,9 +6,10 @@ _Read this in other languages:_
66
[_日本語_](README.ja-JP.md),
77
[_Français_](README.fr-FR.md),
88
[_Português_](README.pt-BR.md),
9-
[_Türkçe_](README.tr-TR.md)
9+
[_Türkçe_](README.tr-TR.md),
10+
[_한국어_](README.ko-KR.md)
1011

11-
In computer science, a **heap** is a specialized tree-based
12+
In computer science, a **heap** is a specialized tree-based
1213
data structure that satisfies the heap property described
1314
below.
1415

@@ -23,7 +24,7 @@ to the key of `C`
2324

2425
![Heap](https://upload.wikimedia.org/wikipedia/commons/3/38/Max-Heap.svg)
2526

26-
The node at the "top" of the heap with no parents is
27+
The node at the "top" of the heap with no parents is
2728
called the root node.
2829

2930
## References

‎src/data-structures/queue/README.md‎

Lines changed: 16 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -5,22 +5,23 @@ _Read this in other languages:_
55
[_Русский_](README.ru-RU.md),
66
[_日本語_](README.ja-JP.md),
77
[_Français_](README.fr-FR.md),
8-
[_Português_](README.pt-BR.md), [_한국어_](README.ko-KR.md)
8+
[_Português_](README.pt-BR.md),
9+
[_한국어_](README.ko-KR.md)
910

10-
In computer science, a **queue** is a particular kind of abstract data
11-
type or collection in which the entities in the collection are
12-
kept in order and the principle (or only) operations on the
13-
collection are the addition of entities to the rear terminal
14-
position, known as enqueue, and removal of entities from the
15-
front terminal position, known as dequeue. This makes the queue
16-
a First-In-First-Out (FIFO) data structure. In a FIFO data
17-
structure, the first element added to the queue will be the
18-
first one to be removed. This is equivalent to the requirement
19-
that once a new element is added, all elements that were added
20-
before have to be removed before the new element can be removed.
21-
Often a peek or front operation is also entered, returning the
22-
value of the front element without dequeuing it. A queue is an
23-
example of a linear data structure, or more abstractly a
11+
In computer science, a **queue** is a particular kind of abstract data
12+
type or collection in which the entities in the collection are
13+
kept in order and the principle (or only) operations on the
14+
collection are the addition of entities to the rear terminal
15+
position, known as enqueue, and removal of entities from the
16+
front terminal position, known as dequeue. This makes the queue
17+
a First-In-First-Out (FIFO) data structure. In a FIFO data
18+
structure, the first element added to the queue will be the
19+
first one to be removed. This is equivalent to the requirement
20+
that once a new element is added, all elements that were added
21+
before have to be removed before the new element can be removed.
22+
Often a peek or front operation is also entered, returning the
23+
value of the front element without dequeuing it. A queue is an
24+
example of a linear data structure, or more abstractly a
2425
sequential collection.
2526

2627
Representation of a FIFO (first in, first out) queue

0 commit comments

Comments
 (0)