You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: 1-js/05-data-types/04-array/article.md
+3-3Lines changed: 3 additions & 3 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -6,7 +6,7 @@ But quite often we find that we need an *ordered collection*, where we have a 1s
6
6
7
7
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.
8
8
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.
10
10
11
11
## Declaration
12
12
@@ -136,7 +136,7 @@ A [queue](https://en.wikipedia.org/wiki/Queue_(abstract_data_type)) is one of th
136
136
137
137
Arrays support both operations.
138
138
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.
140
140
141
141
There's another use case for arrays -- the data structure named [stack](https://en.wikipedia.org/wiki/Stack_(abstract_data_type)).
142
142
@@ -145,7 +145,7 @@ It supports two operations:
145
145
-`push` adds an element to the end.
146
146
-`pop` takes an element from the end.
147
147
148
-
So new elements are added or taken, always from the "end".
148
+
So new elements are added or taken always from the "end".
149
149
150
150
A stack is usually illustrated as a pack of cards: new cards are added to the top or taken from the top:
0 commit comments