GeezerVisonThe World Wide Web, restored to 800 pixels of glory. | |||||||||||||||||||||||||||||||||||||||||||||||
| Home|About|Gaming cabinet|Archives|How it works|Starter sites | |||||||||||||||||||||||||||||||||||||||||||||||
GeezerVison is showing github.com — Arrays by ArtemZununov · Pull Request #115 · javascript-tutorial/uk.javascript.info Conversation
| |||||||||||||||||||||||||||||||||||||||||||||||
There was an error while loading. Please reload this page.
|
Артем Зунунов seems not to be a GitHub user. You need a GitHub account to be able to sign the CLA. If you have already a GitHub account, please add the email address used for this commit to your account. You have signed the CLA already but the status is still pending? Let us recheck it. |
Sorry, something went wrong.
There was an error while loading. Please reload this page.
Address some possible issues in 1.2.10
Address some possible issues in translation of 1.2.9
Address some possible issues in translation of 1.2.11
There was a problem hiding this comment.
The reason will be displayed to describe this comment to others. Learn more.
Хороший переклад! Дякую!
Є деякі правки
Sorry, something went wrong.
There was an error while loading. Please reload this page.
There was an error while loading. Please reload this page.
There was an error while loading. Please reload this page.
There was an error while loading. Please reload this page.
There was an error while loading. Please reload this page.
| @@ -89,6 +89,6 @@ alert( getMaxSubSum([1, 2, 3]) ); // 6 | |||
| alert( getMaxSubSum([-1, -2, -3]) ); // 0 | |||
There was a problem hiding this comment.
The reason will be displayed to describe this comment to others. Learn more.
Будь ласка, перекладіть також коментарі в коді вище.
Sorry, something went wrong.
There was an error while loading. Please reload this page.
There was an error while loading. Please reload this page.
There was an error while loading. Please reload this page.
|
|
||
| A [queue](https://en.wikipedia.org/wiki/Queue_(abstract_data_type)) is one of the most common uses of an array. In computer science, this means an ordered collection of elements which supports two operations: | ||
| [Черга](https://en.wikipedia.org/wiki/Queue_(abstract_data_type)) - один з найбільш популярних варіантів використання об'єкту. У комп'ютерних науках так позначають | ||
| колекцію елементів, яка підтримує дві операції: |
There was a problem hiding this comment.
The reason will be displayed to describe this comment to others. Learn more.
Видаліть цей рядок. Нумерація рядків має збігатися з оригіналом.
Sorry, something went wrong.
There was an error while loading. Please reload this page.
| На практиці це дуже часто стає у нагоді. Наприклад, черга з повідомлень, які необхідно показувати на екрані. | ||
|
|
||
| There's another use case for arrays -- the data structure named [stack](https://en.wikipedia.org/wiki/Stack_(abstract_data_type)). | ||
| Існує також інший варіант використання масивів - структура даних, яка називається [стек](https://en.wikipedia.org/wiki/Stack_(abstract_data_type)). |
There was a problem hiding this comment.
The reason will be displayed to describe this comment to others. Learn more.
Якщо є відповідна стаття українською мовою, її слід використовувати замість оригіналу: https://uk.wikipedia.org/wiki/Стек
Sorry, something went wrong.
There was an error while loading. Please reload this page.
| So new elements are added or taken always from the "end". | ||
| Таким чином нові елементи завжди додаються або видаляються з "кінця". | ||
|
|
||
| A stack is usually illustrated as a pack of cards: new cards are added to the top or taken from the top: |
There was a problem hiding this comment.
The reason will be displayed to describe this comment to others. Learn more.
Видаліть цей рядок.
Sorry, something went wrong.
There was an error while loading. Please reload this page.
|
Please make the requested changes. After it, add a comment "/done". |
Sorry, something went wrong.
There was an error while loading. Please reload this page.
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
Co-authored-by: Taras <[email protected]>
|
@all-contributors please add @ArtemZununov for translation. |
Sorry, something went wrong.
There was an error while loading. Please reload this page.
|
I've put up a pull request to add @ArtemZununov! 🎉 |
Sorry, something went wrong.
There was an error while loading. Please reload this page.
There was an error while loading. Please reload this page.
Successfully merging this pull request may close these issues.
There was an error while loading. Please reload this page.