Skip to content

Commit 88ce8fa

Browse files
authored
👾 smth
1 parent 1dcf503 commit 88ce8fa

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

‎1-js/05-data-types/04-array/article.md‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@ But quite often we find that we need an *ordered collection*, where we have a 1s
66

77
It is not convenient to use an object here, because it provides no methods to manage the order of elements. We can’t insert a new property “between” the existing ones. Objects are just not meant for such use.
88

9-
There exists a special data structure, named `Array`, to store ordered collections.
9+
There exists a special data structure named `Array`, to store ordered collections.
1010

1111
## Declaration
1212

@@ -136,7 +136,7 @@ A [queue](https://en.wikipedia.org/wiki/Queue_(abstract_data_type)) is one of th
136136

137137
Arrays support both operations.
138138

139-
In practice, we need it very often. For example, a queue of messages that need to be shown on-screen.
139+
In practice we need it very often. For example, a queue of messages that need to be shown on-screen.
140140

141141
There's another use case for arrays -- the data structure named [stack](https://en.wikipedia.org/wiki/Stack_(abstract_data_type)).
142142

@@ -145,7 +145,7 @@ It supports two operations:
145145
- `push` adds an element to the end.
146146
- `pop` takes an element from the end.
147147

148-
So new elements are added or taken, always from the "end".
148+
So new elements are added or taken always from the "end".
149149

150150
A stack is usually illustrated as a pack of cards: new cards are added to the top or taken from the top:
151151

0 commit comments

Comments
 (0)