adambard/learnxinyminutes-docs
1
1
Fork 0
mirror of https://github.com/adambard/learnxinyminutes-docs.git synced 2024-11-28 02:16:55 +03:00
Code Issues Projects Releases Wiki Activity

Merge pull request #2976 from milenaduo/patch-4

Browse Source 
[dynamic-programming/pt-br] - Better reading
This commit is contained in:
Andre Polykanine A.K.A. Menelion Elensúlë 2017-10-28 19:19:59 +03:00 committed by GitHub
commit ce1d290a5f
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
pt-br/dynamic-programming-pt.html.markdown
View File

@ -51,7 +51,7 @@ array antecedente e uma variável como maiorSequenciasAteAgora e seu índice
ajudariam a poupar muito tempo.
Um conceito similar poderia ser aplicado ao procurar o maior caminho em um
grafo acíclico dirigido.
---------------------------------------------------------------------------
```
for i=0 to n-1
LS[i]=1
@ -62,7 +62,7 @@ grafo acíclico dirigido.
if (largest < LS[i])
```
### Alguns Problemas Famosos de Programação Dinâmica
## Alguns Problemas Famosos de Programação Dinâmica
```
Floyd Warshall Algorithm - Tutorial and C Program source code:http://www.thelearningpoint.net/computer-science/algorithms-all-to-all-shortest-paths-in-graphs---floyd-warshall-algorithm-with-c-program-source-code