Skip to content

Commit 5570edc

Browse files
kelvinskelvins
authored
Merge pull request kelvins#321 from Carlos-Daniel-Dev/main
C files from Portuguese to English
2 parents 4729bb4 + cc02eba commit 5570edc

27 files changed

+33
-33
lines changed

‎README.md

Lines changed: 26 additions & 26 deletions
Original file line numberDiff line numberDiff line change
@@ -67,7 +67,7 @@ In order to achieve greater coverage and encourage more people to contribute to
6767
<tr>
6868
<td><a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm">Dijkstra's Algorithm</a></td>
6969
<td> <!-- C -->
70-
<a href="./src/c/AlgoritmoDijkstra.c">
70+
<a href="./src/c/DijkstraAlgorithm.c">
7171
<img align="center" height="25" src="./logos/c.svg" />
7272
</a>
7373
</td>
@@ -125,7 +125,7 @@ In order to achieve greater coverage and encourage more people to contribute to
125125
<tr>
126126
<td><a href="https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm">Floyd–Warshall Algorithm</a></td>
127127
<td> <!-- C -->
128-
<a href="./src/c/AlgoritmoFloydWarshall.c">
128+
<a href="./src/c/FloydWarshallAlgorithm.c">
129129
<img align="center" height="25" src="./logos/c.svg" />
130130
</a>
131131
</td>
@@ -241,7 +241,7 @@ In order to achieve greater coverage and encourage more people to contribute to
241241
<tr>
242242
<td><a href="https://en.wikipedia.org/wiki/Graph_traversal">Graph Search</a></td>
243243
<td> <!-- C -->
244-
<a href="./src/c/BuscaEmGrafo.c">
244+
<a href="./src/c/GraphSearch.c">
245245
<img align="center" height="25" src="./logos/c.svg" />
246246
</a>
247247
</td>
@@ -299,7 +299,7 @@ In order to achieve greater coverage and encourage more people to contribute to
299299
<tr>
300300
<td><a href="https://en.wikipedia.org/wiki/Linear_search">Linear Search (Iterative)</a></td>
301301
<td> <!-- C -->
302-
<a href="./src/c/BuscaSequencial.c">
302+
<a href="./src/c/LinearSearch.c">
303303
<img align="center" height="25" src="./logos/c.svg" />
304304
</a>
305305
</td>
@@ -357,7 +357,7 @@ In order to achieve greater coverage and encourage more people to contribute to
357357
<tr>
358358
<td><a href="https://en.wikipedia.org/wiki/Linear_search">Linear Search (Recursive)</a></td>
359359
<td> <!-- C -->
360-
<a href="./src/c/BuscaSequencialRecursiva.c">
360+
<a href="./src/c/RecursiveSequentialSearch.c">
361361
<img align="center" height="25" src="./logos/c.svg" />
362362
</a>
363363
</td>
@@ -415,7 +415,7 @@ In order to achieve greater coverage and encourage more people to contribute to
415415
<tr>
416416
<td><a href="https://www.geeksforgeeks.org/sentinel-linear-search">Linear Search (Sentinel)</a></td>
417417
<td> <!-- C -->
418-
<a href="./src/c/BuscaSentinela.c">
418+
<a href="./src/c/SentinelSearch.c">
419419
<img align="center" height="25" src="./logos/c.svg" />
420420
</a>
421421
</td>
@@ -531,7 +531,7 @@ In order to achieve greater coverage and encourage more people to contribute to
531531
<tr>
532532
<td><a href="https://en.wikipedia.org/wiki/Travelling_salesman_problem">Travelling Salesman</a></td>
533533
<td> <!-- C -->
534-
<a href="./src/c/CaixeiroViajante.c">
534+
<a href="./src/c/TravellingSalesman.c">
535535
<img align="center" height="25" src="./logos/c.svg" />
536536
</a>
537537
</td>
@@ -589,7 +589,7 @@ In order to achieve greater coverage and encourage more people to contribute to
589589
<tr>
590590
<td><a href="https://en.wikipedia.org/wiki/Hamiltonian_path">Hamiltonian Cycle</a></td>
591591
<td> <!-- C -->
592-
<a href="./src/c/CicloHamiltoniano.c">
592+
<a href="./src/c/HamiltonianCycle.c">
593593
<img align="center" height="25" src="./logos/c.svg" />
594594
</a>
595595
</td>
@@ -647,7 +647,7 @@ In order to achieve greater coverage and encourage more people to contribute to
647647
<tr>
648648
<td><a href="https://graphstream-project.org/doc/Algorithms/Connected-Components">Connected Components</a></td>
649649
<td> <!-- C -->
650-
<a href="./src/c/ComponentesConexos.c">
650+
<a href="./src/c/ConnectedComponents.c">
651651
<img align="center" height="25" src="./logos/c.svg" />
652652
</a>
653653
</td>
@@ -705,7 +705,7 @@ In order to achieve greater coverage and encourage more people to contribute to
705705
<tr>
706706
<td><a href="https://en.wikipedia.org/wiki/Exponentiation">Exponentiation (Iterative)</a></td>
707707
<td> <!-- C -->
708-
<a href="./src/c/Exponenciacao.c">
708+
<a href="./src/c/Exponentiation.c">
709709
<img align="center" height="25" src="./logos/c.svg" />
710710
</a>
711711
</td>
@@ -763,7 +763,7 @@ In order to achieve greater coverage and encourage more people to contribute to
763763
<tr>
764764
<td><a href="https://en.wikipedia.org/wiki/Exponentiation">Exponentiation (Recursive)</a></td>
765765
<td> <!-- C -->
766-
<a href="./src/c/ExponenciacaoRecursiva.c">
766+
<a href="./src/c/RecursiveExponentiation.c">
767767
<img align="center" height="25" src="./logos/c.svg" />
768768
</a>
769769
</td>
@@ -821,7 +821,7 @@ In order to achieve greater coverage and encourage more people to contribute to
821821
<tr>
822822
<td><a href="https://en.wikipedia.org/wiki/Factorial">Factorial (Iterative)</a></td>
823823
<td> <!-- C -->
824-
<a href="./src/c/Fatorial.c">
824+
<a href="./src/c/Factorial.c">
825825
<img align="center" height="25" src="./logos/c.svg" />
826826
</a>
827827
</td>
@@ -879,7 +879,7 @@ In order to achieve greater coverage and encourage more people to contribute to
879879
<tr>
880880
<td><a href="https://en.wikipedia.org/wiki/Factorial">Factorial (Recursive)</a></td>
881881
<td> <!-- C -->
882-
<a href="./src/c/FatorialRecursiva.c">
882+
<a href="./src/c/RecursiveFactorial.c">
883883
<img align="center" height="25" src="./logos/c.svg" />
884884
</a>
885885
</td>
@@ -1693,7 +1693,7 @@ In order to achieve greater coverage and encourage more people to contribute to
16931693
<tr>
16941694
<td><a href="https://en.wikipedia.org/wiki/Binary_tree">Binary Tree</a></td>
16951695
<td> <!-- C -->
1696-
<a href="./src/c/ArvoreBinaria.c">
1696+
<a href="./src/c/BinaryTree.c">
16971697
<img align="center" height="25" src="./logos/c.svg" />
16981698
</a>
16991699
</td>
@@ -1751,7 +1751,7 @@ In order to achieve greater coverage and encourage more people to contribute to
17511751
<tr>
17521752
<td><a href="https://en.wikipedia.org/wiki/Binary_search_tree">Binary Search Tree</a></td>
17531753
<td> <!-- C -->
1754-
<a href="./src/c/ArvoreBinariaDeBusca.c">
1754+
<a href="./src/c/BinarySearchTree.c">
17551755
<img align="center" height="25" src="./logos/c.svg" />
17561756
</a>
17571757
</td>
@@ -1867,7 +1867,7 @@ In order to achieve greater coverage and encourage more people to contribute to
18671867
<tr>
18681868
<td><a href="https://en.wikipedia.org/wiki/Queue_(abstract_data_type)">Queue</a></td>
18691869
<td> <!-- C -->
1870-
<a href="./src/c/Fila.c">
1870+
<a href="./src/c/Queue.c">
18711871
<img align="center" height="25" src="./logos/c.svg" />
18721872
</a>
18731873
</td>
@@ -1925,7 +1925,7 @@ In order to achieve greater coverage and encourage more people to contribute to
19251925
<tr>
19261926
<td><a href="https://iq.opengenus.org/dynamic-queue/">Dynamic Queue</a></td>
19271927
<td> <!-- C -->
1928-
<a href="./src/c/FilaEncadeadaDinamica.c">
1928+
<a href="./src/c/DynamicQueue.c">
19291929
<img align="center" height="25" src="./logos/c.svg" />
19301930
</a>
19311931
</td>
@@ -1983,7 +1983,7 @@ In order to achieve greater coverage and encourage more people to contribute to
19831983
<tr>
19841984
<td><a href="https://en.wikipedia.org/wiki/Graph_(abstract_data_type)">Graph</a></td>
19851985
<td> <!-- C -->
1986-
<a href="./src/c/Grafos.c">
1986+
<a href="./src/c/Graphs.c">
19871987
<img align="center" height="25" src="./logos/c.svg" />
19881988
</a>
19891989
</td>
@@ -2041,7 +2041,7 @@ In order to achieve greater coverage and encourage more people to contribute to
20412041
<tr>
20422042
<td><a href="https://www.programiz.com/dsa/circular-linked-list">Circular Linked List</a></td>
20432043
<td> <!-- C -->
2044-
<a href="./src/c/ListaCircularLigada.c">
2044+
<a href="./src/c/CircularLinkedList.c">
20452045
<img align="center" height="25" src="./logos/c.svg" />
20462046
</a>
20472047
</td>
@@ -2099,7 +2099,7 @@ In order to achieve greater coverage and encourage more people to contribute to
20992099
<tr>
21002100
<td><a href="https://en.wikipedia.org/wiki/Linked_list">Singly Linked List</a></td>
21012101
<td> <!-- C -->
2102-
<a href="./src/c/ListaEncadeada.c">
2102+
<a href="./src/c/LinkedList.c">
21032103
<img align="center" height="25" src="./logos/c.svg" />
21042104
</a>
21052105
</td>
@@ -2157,7 +2157,7 @@ In order to achieve greater coverage and encourage more people to contribute to
21572157
<tr>
21582158
<td><a href="https://en.wikipedia.org/wiki/Linked_list">Doubly Linked List</a></td>
21592159
<td> <!-- C -->
2160-
<a href="./src/c/ListaDuplamenteEncadeada.c">
2160+
<a href="./src/c/DoublyLinkedList.c">
21612161
<img align="center" height="25" src="./logos/c.svg" />
21622162
</a>
21632163
</td>
@@ -2215,7 +2215,7 @@ In order to achieve greater coverage and encourage more people to contribute to
22152215
<tr>
22162216
<td><a href="https://en.wikipedia.org/wiki/Linked_list">Unordered Linked List</a></td>
22172217
<td> <!-- C -->
2218-
<a href="./src/c/ListaLigadaNaoOrdenada.c">
2218+
<a href="./src/c/UnorderedLinkedList.c">
22192219
<img align="center" height="25" src="./logos/c.svg" />
22202220
</a>
22212221
</td>
@@ -2273,7 +2273,7 @@ In order to achieve greater coverage and encourage more people to contribute to
22732273
<tr>
22742274
<td>Sorted Linked List</td>
22752275
<td> <!-- C -->
2276-
<a href="./src/c/ListaSequencialOrdenada.c">
2276+
<a href="./src/c/SortedLinkedList.c">
22772277
<img align="center" height="25" src="./logos/c.svg" />
22782278
</a>
22792279
</td>
@@ -2331,7 +2331,7 @@ In order to achieve greater coverage and encourage more people to contribute to
23312331
<tr>
23322332
<td><a href="https://en.wikipedia.org/wiki/Stack_(abstract_data_type)">Stack</a></td>
23332333
<td> <!-- C -->
2334-
<a href="./src/c/Pilha.c">
2334+
<a href="./src/c/Stack.c">
23352335
<img align="center" height="25" src="./logos/c.svg" />
23362336
</a>
23372337
</td>
@@ -2389,7 +2389,7 @@ In order to achieve greater coverage and encourage more people to contribute to
23892389
<tr>
23902390
<td>Dynamic Stack</td>
23912391
<td> <!-- C -->
2392-
<a href="./src/c/PilhaLigadaDinamica.c">
2392+
<a href="./src/c/DynamicStack.c">
23932393
<img align="center" height="25" src="./logos/c.svg" />
23942394
</a>
23952395
</td>
@@ -3669,7 +3669,7 @@ In order to achieve greater coverage and encourage more people to contribute to
36693669
<tr>
36703670
<td><a href="https://en.wikipedia.org/wiki/Palindrome">Palindrome</a></td>
36713671
<td> <!-- C -->
3672-
<a href="./src/c/Palindromo.c">
3672+
<a href="./src/c/Palindrome.c">
36733673
<img align="center" height="25" src="./logos/c.svg" />
36743674
</a>
36753675
</td>

‎src/c/ArvoreBinariaDeBusca.c renamed to ‎src/c/BinarySearchTree.c

File renamed without changes.

‎src/c/ArvoreBinaria.c renamed to ‎src/c/BinaryTree.c

File renamed without changes.

‎src/c/ListaCircularLigada.c renamed to ‎src/c/CircularLinkedList.c

File renamed without changes.

‎src/c/ComponentesConexos.c renamed to ‎src/c/ConnectedComponents.c

File renamed without changes.

‎src/c/AlgoritmoDijkstra.c renamed to ‎src/c/DijkstraAlgorithm.c

File renamed without changes.

‎src/c/ListaDuplamenteEncadeada.c renamed to ‎src/c/DoublyLinkedList.c

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77
#include <stdio.h>
88
#include <stdlib.h>
99

10-
/* Lista encadeada utilizando celula cabeça */
10+
/* Lista encadeada utilizando celula cabeça */
1111

1212
typedef struct cel celula;
1313
struct cel{
@@ -16,15 +16,15 @@ struct cel{
1616
struct cel *ant;
1717
};
1818

19-
/* O ponteiro 'p' é a cabeça da lista*/
19+
/* O ponteiro 'p' é a cabeça da lista*/
2020

2121
void insereInicio(int x, celula *p) /* Insere no inicio da lista*/
2222
{
2323
celula *nova, *q;
2424
nova = malloc (sizeof (celula));
2525
nova->dado = x;
2626
nova->prox = p->prox;
27-
/* verifica se a lista está vazia*/
27+
/* verifica se a lista está vazia*/
2828
if (p->prox != NULL)
2929
{
3030
q = nova->prox;
@@ -93,9 +93,9 @@ void libera (celula *ini)
9393
celula *p;
9494
p=ini;
9595
while (p != NULL) {
96-
celula *q = p->prox; /* guarda referência para o próximo elemento*/
97-
free(p); /* libera a memória apontada por p */
98-
p = q; /* faz p apontar para o próximo */
96+
celula *q = p->prox; /* guarda referência para o próximo elemento*/
97+
free(p); /* libera a memória apontada por p */
98+
p = q; /* faz p apontar para o próximo */
9999
}
100100
}
101101

‎src/c/FilaEncadeadaDinamica.c renamed to ‎src/c/DynamicQueue.c

File renamed without changes.

‎src/c/PilhaLigadaDinamica.c renamed to ‎src/c/DynamicStack.c

File renamed without changes.

‎src/c/Exponenciacao.c renamed to ‎src/c/Exponentiation.c

File renamed without changes.

0 commit comments

Comments
 (0)