Skip to content

Commit 28ee030

Browse files
trekhlebtrekhleb
committed
Add Portuguese.
1 parent 09a354a commit 28ee030

8 files changed

+46
-39
lines changed

‎README.es-ES.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,8 @@ _Léelo en otros idiomas:_
1515
[_繁體中文_](README.zh-TW.md),
1616
[_한국어_](README.ko-KR.md),
1717
[_Polski_](README.pl-PL.md),
18-
[_Français_](README.fr-FR.md)
18+
[_Français_](README.fr-FR.md),
19+
[_Português_](README.pt-BR.md)
1920

2021
> Estamos escribiendo un libro que explicará claramente, en detalle, los principales algoritmos.
2122
Si desea ser notificado cuando se publique el libro "Algoritmos JavaScript

‎README.fr-FR.md

+7-6
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,8 @@ _Lisez ceci dans d'autres langues:_
1616
[_繁體中文_](README.zh-TW.md),
1717
[_한국어_](README.ko-KR.md),
1818
[_Polski_](README.pl-PL.md),
19-
[_Español_](README.es-ES.md)
19+
[_Español_](README.es-ES.md),
20+
[_Português_](README.pt-BR.md)
2021

2122
> Nous écrivons actuellement un livre qui expliquera clairement, en détail, les
2223
principaux algorithmes. Si vous souhaitez être notifié lorsque le livre
@@ -42,11 +43,11 @@ fonctions ou d'opérations pouvant être appliquées sur ces données.
4243
* `B` [Queue de Priorité](src/data-structures/priority-queue)
4344
* `A` [Trie](src/data-structures/trie)
4445
* `A` [Arbre](src/data-structures/tree)
45-
* `A` [Arbre de recherche Binaire](src/data-structures/tree/binary-search-tree)
46-
* `A` [Arbre AVL](src/data-structures/tree/avl-tree)
47-
* `A` [Arbre Red-Black](src/data-structures/tree/red-black-tree)
48-
* `A` [Arbre de Segments](src/data-structures/tree/segment-tree) - avec exemples de requêtes de type min/max/somme sur intervalles
49-
* `A` [Arbre de Fenwick](src/data-structures/tree/fenwick-tree) (Arbre Binaire Indexé)
46+
* `A` [Arbre de recherche Binaire](src/data-structures/tree/binary-search-tree)
47+
* `A` [Arbre AVL](src/data-structures/tree/avl-tree)
48+
* `A` [Arbre Red-Black](src/data-structures/tree/red-black-tree)
49+
* `A` [Arbre de Segments](src/data-structures/tree/segment-tree) - avec exemples de requêtes de type min/max/somme sur intervalles
50+
* `A` [Arbre de Fenwick](src/data-structures/tree/fenwick-tree) (Arbre Binaire Indexé)
5051
* `A` [Graphe](src/data-structures/graph) (orienté et non orienté)
5152
* `A` [Ensembles Disjoints](src/data-structures/disjoint-set)
5253
* `A` [Filtre de Bloom](src/data-structures/bloom-filter)

‎README.ko-KR.md

+7-6
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,8 @@ _Read this in other languages:_
1414
[_繁體中文_](README.zh-TW.md),
1515
[_Polski_](README.pl-PL.md),
1616
[_Français_](README.fr-FR.md),
17-
[_Español_](README.es-ES.md)
17+
[_Español_](README.es-ES.md),
18+
[_Português_](README.pt-BR.md)
1819

1920
> 우리는 주요 알고리즘에 대해 더 자세한 설명을 담은 책을 제작 중입니다.
2021
만약 “JavaScript Algorithms” 책이 언제 출시되는지 알고 싶다면
@@ -38,11 +39,11 @@ _Read this in other languages:_
3839
* `B` [우선순위 큐](src/data-structures/priority-queue)
3940
* `A` [트라이](src/data-structures/trie)
4041
* `A` [트리](src/data-structures/tree)
41-
* `A` [이진 탐색 트리](src/data-structures/tree/binary-search-tree)
42-
* `A` [AVL 트리](src/data-structures/tree/avl-tree)
43-
* `A` [Red-Black 트리](src/data-structures/tree/red-black-tree)
44-
* `A` [세그먼트 트리](src/data-structures/tree/segment-tree) - min/max/sum range 쿼리 예제.
45-
* `A` [Fenwick 트리](src/data-structures/tree/fenwick-tree) (Binary Indexed Tree)
42+
* `A` [이진 탐색 트리](src/data-structures/tree/binary-search-tree)
43+
* `A` [AVL 트리](src/data-structures/tree/avl-tree)
44+
* `A` [Red-Black 트리](src/data-structures/tree/red-black-tree)
45+
* `A` [세그먼트 트리](src/data-structures/tree/segment-tree) - min/max/sum range 쿼리 예제.
46+
* `A` [Fenwick 트리](src/data-structures/tree/fenwick-tree) (Binary Indexed Tree)
4647
* `A` [그래프](src/data-structures/graph) (유방향, 무방향)
4748
* `A` [서로소 집합](src/data-structures/disjoint-set)
4849
* `A` [블룸 필터](src/data-structures/bloom-filter)

‎README.md

+7-6
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,8 @@ _Read this in other languages:_
1616
[_한국어_](README.ko-KR.md),
1717
[_Polski_](README.pl-PL.md),
1818
[_Français_](README.fr-FR.md),
19-
[_Español_](README.es-ES.md)
19+
[_Español_](README.es-ES.md),
20+
[_Português_](README.pt-BR.md)
2021

2122
> We’re writing a book that will clearly explain, in detail, the main algorithms.
2223
If you’d like to be notified when the “JavaScript Algorithms” book
@@ -40,11 +41,11 @@ the data.
4041
* `B` [Priority Queue](src/data-structures/priority-queue)
4142
* `A` [Trie](src/data-structures/trie)
4243
* `A` [Tree](src/data-structures/tree)
43-
* `A` [Binary Search Tree](src/data-structures/tree/binary-search-tree)
44-
* `A` [AVL Tree](src/data-structures/tree/avl-tree)
45-
* `A` [Red-Black Tree](src/data-structures/tree/red-black-tree)
46-
* `A` [Segment Tree](src/data-structures/tree/segment-tree) - with min/max/sum range queries examples
47-
* `A` [Fenwick Tree](src/data-structures/tree/fenwick-tree) (Binary Indexed Tree)
44+
* `A` [Binary Search Tree](src/data-structures/tree/binary-search-tree)
45+
* `A` [AVL Tree](src/data-structures/tree/avl-tree)
46+
* `A` [Red-Black Tree](src/data-structures/tree/red-black-tree)
47+
* `A` [Segment Tree](src/data-structures/tree/segment-tree) - with min/max/sum range queries examples
48+
* `A` [Fenwick Tree](src/data-structures/tree/fenwick-tree) (Binary Indexed Tree)
4849
* `A` [Graph](src/data-structures/graph) (both directed and undirected)
4950
* `A` [Disjoint Set](src/data-structures/disjoint-set)
5051
* `A` [Bloom Filter](src/data-structures/bloom-filter)

‎README.pl-PL.md

+7-6
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,8 @@ _Read this in other languages:_
1616
[_繁體中文_](README.zh-TW.md),
1717
[_한국어_](README.ko-KR.md),
1818
[_Français_](README.fr-FR.md),
19-
[_Español_](README.es-ES.md)
19+
[_Español_](README.es-ES.md),
20+
[_Português_](README.pt-BR.md)
2021

2122
> Jesteśmy w trakcie pisania książki, która w jasny i specyficzny sposób,
2223
wyjaśni główne algorytmy. Jeżeli chcesz dostać powiadomienie o tym kiedy
@@ -41,11 +42,11 @@ pomiędzy nimi, zadaniami lub działaniami, które mogą dotyczyć danych.
4142
* `B` [Kolejka Priorytetowa](src/data-structures/priority-queue)
4243
* `A` [Trie](src/data-structures/trie)
4344
* `A` [Drzewo](src/data-structures/tree)
44-
* `A` [Wyszukiwanie Binarne](src/data-structures/tree/binary-search-tree)
45-
* `A` [AVL Drzewo](src/data-structures/tree/avl-tree)
46-
* `A` [Drzewa czerwono-czarne](src/data-structures/tree/red-black-tree)
47-
* `A` [Drzewo Segmentu](src/data-structures/tree/segment-tree) - z przykładami zapytań o min / max / sumie sum
48-
* `A` [Drzewo Fenwicka](src/data-structures/tree/fenwick-tree) (Drzewo Indeksowane Binarnie)
45+
* `A` [Wyszukiwanie Binarne](src/data-structures/tree/binary-search-tree)
46+
* `A` [AVL Drzewo](src/data-structures/tree/avl-tree)
47+
* `A` [Drzewa czerwono-czarne](src/data-structures/tree/red-black-tree)
48+
* `A` [Drzewo Segmentu](src/data-structures/tree/segment-tree) - z przykładami zapytań o min / max / sumie sum
49+
* `A` [Drzewo Fenwicka](src/data-structures/tree/fenwick-tree) (Drzewo Indeksowane Binarnie)
4950
* `A` [Graf](src/data-structures/graph) (zarówno skierowane i nieukierunkowane)
5051
* `A` [Rozłączny Zestaw](src/data-structures/disjoint-set)
5152
* `A` [Filtr Blooma](src/data-structures/bloom-filter)

‎README.pt-BT.md ‎README.pt-BR.md

+7-7
Original file line numberDiff line numberDiff line change
@@ -11,13 +11,13 @@ com explicações relacionadas e links para leitura adicional (incluindo
1111
vídeos para YouTube)
1212

1313
_Leia isto em outros idiomas:_
14+
[_English_](https://github.com/trekhleb/javascript-algorithms/)
1415
[_简体中文_](README.zh-CN.md),
1516
[_繁體中文_](README.zh-TW.md),
1617
[_한국어_](README.ko-KR.md),
1718
[_Polski_](README.pl-PL.md),
1819
[_Français_](README.fr-FR.md),
1920
[_Español_](README.es-ES.md)
20-
[_Português_](README.pt-BR.md)
2121

2222
> Nós estamos escrevendo um livro que explicará claramente, em datalhes, os principais algoritmos.
2323
Se você deseja ser notificado quando o livro "Algoritmos em JavaScript”
@@ -41,11 +41,11 @@ os dados.
4141
* `B` [Priority Queue](src/data-structures/priority-queue)
4242
* `A` [Trie](src/data-structures/trie)
4343
* `A` [Tree](src/data-structures/tree)
44-
* `A` [Binary Search Tree](src/data-structures/tree/binary-search-tree)
45-
* `A` [AVL Tree](src/data-structures/tree/avl-tree)
46-
* `A` [Red-Black Tree](src/data-structures/tree/red-black-tree)
47-
* `A` [Segment Tree](src/data-structures/tree/segment-tree) - com exemplos de consultas min / max / sum range
48-
* `A` [Fenwick Tree](src/data-structures/tree/fenwick-tree) (Árvore indexada binária)
44+
* `A` [Binary Search Tree](src/data-structures/tree/binary-search-tree)
45+
* `A` [AVL Tree](src/data-structures/tree/avl-tree)
46+
* `A` [Red-Black Tree](src/data-structures/tree/red-black-tree)
47+
* `A` [Segment Tree](src/data-structures/tree/segment-tree) - com exemplos de consultas min / max / sum range
48+
* `A` [Fenwick Tree](src/data-structures/tree/fenwick-tree) (Árvore indexada binária)
4949
* `A` [Graph](src/data-structures/graph) (ambos dirigidos e não direcionados)
5050
* `A` [Disjoint Set](src/data-structures/disjoint-set)
5151
* `A` [Bloom Filter](src/data-structures/bloom-filter)
@@ -285,4 +285,4 @@ Abaixo está a lista de algumas das notações Big O mais usadas e suas compara
285285
| **Quick sort** | n&nbsp;log(n) | n&nbsp;log(n) | n<sup>2</sup> | log(n) | Não | O Quicksort geralmente é feito no local com o espaço de pilha O O(log(n)) stack space |
286286
| **Shell sort** | n&nbsp;log(n) | depende da sequência de lacunas | n&nbsp;(log(n))<sup>2</sup> | 1 | Não | |
287287
| **Counting sort** | n + r | n + r | n + r | n + r | Sim | r - maior número na matriz |
288-
| **Radix sort** | n * k | n * k | n * k | n + k | Sim | k - comprimento da chave mais longa |
288+
| **Radix sort** | n * k | n * k | n * k | n + k | Sim | k - comprimento da chave mais longa |

‎README.zh-CN.md

+7-6
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,8 @@ _Read this in other languages:_
1313
[_한국어_](README.ko-KR.md),
1414
[_Polski_](README.pl-PL.md),
1515
[_Français_](README.fr-FR.md),
16-
[_Español_](README.es-ES.md)
16+
[_Español_](README.es-ES.md),
17+
[_Português_](README.pt-BR.md)
1718

1819
> We’re writing a book that will clearly explain, in detail, the main algorithms.
1920
If you’d like to be notified when the “JavaScript Algorithms” book
@@ -34,11 +35,11 @@ launches, [click here](https://upscri.be/402324/).
3435
* `B` [优先队列](src/data-structures/priority-queue)
3536
* `A` [字典树](src/data-structures/trie)
3637
* `A` [树](src/data-structures/tree)
37-
* `A` [二叉查找树](src/data-structures/tree/binary-search-tree)
38-
* `A` [AVL 树](src/data-structures/tree/avl-tree)
39-
* `A` [红黑树](src/data-structures/tree/red-black-tree)
40-
* `A` [线段树](src/data-structures/tree/segment-tree) - 使用 最小/最大/总和 范围查询示例
41-
* `A` [树状数组](src/data-structures/tree/fenwick-tree) (二叉索引树)
38+
* `A` [二叉查找树](src/data-structures/tree/binary-search-tree)
39+
* `A` [AVL 树](src/data-structures/tree/avl-tree)
40+
* `A` [红黑树](src/data-structures/tree/red-black-tree)
41+
* `A` [线段树](src/data-structures/tree/segment-tree) - 使用 最小/最大/总和 范围查询示例
42+
* `A` [树状数组](src/data-structures/tree/fenwick-tree) (二叉索引树)
4243
* `A` [图](src/data-structures/graph) (有向图与无向图)
4344
* `A` [并查集](src/data-structures/disjoint-set)
4445
* `A` [布隆过滤器](src/data-structures/bloom-filter)

‎README.zh-TW.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,8 @@ _Read this in other languages:_
1212
[_한국어_](README.ko-KR.md),
1313
[_Polski_](README.pl-PL.md),
1414
[_Français_](README.fr-FR.md),
15-
[_Español_](README.es-ES.md)
15+
[_Español_](README.es-ES.md),
16+
[_Português_](README.pt-BR.md)
1617

1718
> We’re writing a book that will clearly explain, in detail, the main algorithms.
1819
If you’d like to be notified when the “JavaScript Algorithms” book

0 commit comments

Comments
 (0)