hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-11-10 11:09:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add Spanish link for the Linked List README.

Browse Source
This commit is contained in:
Oleksii Trekhleb 2020-12-20 20:18:12 +01:00
parent 88cef5f548
commit 4b6c601158
2 changed files with 24 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
src/algorithms/math/is-power-of-two/README.md
View File

@ -1,14 +1,13 @@
# Is a power of two # Is a power of two
Given a positive integer, write a function to find if it is Given a positive integer, write a function to find if it is
a power of two or not. a power of two or not.
**Naive solution** **Naive solution**
In naive solution we just keep dividing the number by two In naive solution we just keep dividing the number by two
unless the number becomes `1` and every time we do so we unless the number becomes `1` and every time we do so, we
check that remainder after division is always `0`. Otherwise check that remainder after division is always `0`. Otherwise, the number can't be a power of two.
the number can't be a power of two.
**Bitwise solution** **Bitwise solution**
@ -23,8 +22,8 @@ signed integer with a value of -128 looks like: `10000000`)
8: 1000 8: 1000
``` ```
So after checking that the number is greater than zero, So after checking that the number is greater than zero,
we can use a bitwise hack to test that one and only one we can use a bitwise hack to test that one and only one
bit is set. bit is set.
``` ```
@ -38,11 +37,11 @@ For example for number `8` that operations will look like:
- 0001 - 0001
---- ----
0111 0111
1000 1000
& 0111 & 0111
---- ----
0000 0000
``` ```
## References ## References

33
src/data-structures/linked-list/README.md
View File

@ -5,23 +5,24 @@ _Read this in other languages:_
[_Русский_](README.ru-RU.md), [_Русский_](README.ru-RU.md),
[_日本語_](README.ja-JP.md), [_日本語_](README.ja-JP.md),
[_Português_](README.pt-BR.md), [_Português_](README.pt-BR.md),
[_한국어_](README.ko-KR.md) [_한국어_](README.ko-KR.md),
[_Español_](README.es-ES.md),
In computer science, a **linked list** is a linear collection In computer science, a **linked list** is a linear collection
of data elements, in which linear order is not given by of data elements, in which linear order is not given by
their physical placement in memory. Instead, each their physical placement in memory. Instead, each
element points to the next. It is a data structure element points to the next. It is a data structure
consisting of a group of nodes which together represent consisting of a group of nodes which together represent
a sequence. Under the simplest form, each node is a sequence. Under the simplest form, each node is
composed of data and a reference (in other words, composed of data and a reference (in other words,
a link) to the next node in the sequence. This structure a link) to the next node in the sequence. This structure
allows for efficient insertion or removal of elements allows for efficient insertion or removal of elements
from any position in the sequence during iteration. from any position in the sequence during iteration.
More complex variants add additional links, allowing More complex variants add additional links, allowing
efficient insertion or removal from arbitrary element efficient insertion or removal from arbitrary element
references. A drawback of linked lists is that access references. A drawback of linked lists is that access
time is linear (and difficult to pipeline). Faster time is linear (and difficult to pipeline). Faster
access, such as random access, is not feasible. Arrays access, such as random access, is not feasible. Arrays
have better cache locality as compared to linked lists. have better cache locality as compared to linked lists.
![Linked List](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg) ![Linked List](https://upload.wikimedia.org/wikipedia/commons/6/6d/Singly-linked-list.svg)
@ -75,7 +76,7 @@ Contains(head, value)
return true return true
end Contains end Contains
``` ```
### Delete ### Delete
```text ```text