Differences
This shows you the differences between two versions of the page.
|
pa:materiale_test_practic:articole [2016/04/01 01:04] cosmin.dragomir [Divide et Impera] |
pa:materiale_test_practic:articole [2016/04/02 12:38] (current) cosmin.dragomir [Programare dinamică] |
||
|---|---|---|---|
| Line 2: | Line 2: | ||
| ===== Divide et Impera ===== | ===== Divide et Impera ===== | ||
| + | - [[http://geeksquiz.com/binary-search/|Căutare binară]] | ||
| - [[http://www.infoarena.ro/aplicatii-ale-cautarii-binare|Aplicații ale căutării binare]] | - [[http://www.infoarena.ro/aplicatii-ale-cautarii-binare|Aplicații ale căutării binare]] | ||
| - | - [[http://geeksquiz.com/binary-search/|Căutare binară]] | ||
| - [[http://www.geeksforgeeks.org/write-a-c-program-to-calculate-powxn/|Ridicarea la putere în timp logaritmic]] | - [[http://www.geeksforgeeks.org/write-a-c-program-to-calculate-powxn/|Ridicarea la putere în timp logaritmic]] | ||
| - [[http://www.geeksforgeeks.org/find-missing-number-arithmetic-progression/|Găsirea numărului lipsă dintr-o progresie aritmetică]] | - [[http://www.geeksforgeeks.org/find-missing-number-arithmetic-progression/|Găsirea numărului lipsă dintr-o progresie aritmetică]] | ||
| Line 10: | Line 10: | ||
| ===== Greedy ===== | ===== Greedy ===== | ||
| - | + | - [[https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/|Informații generale]] | |
| - | [1] Informații generale: [[https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/]] | + | - [[http://www.infoarena.ro/metoda-greedy-si-problema-fractionara-a-rucsacului?revision=18|Problema Rucsacului - varianta fracționară]] |
| - | + | - [[http://geeksquiz.com/greedy-algorithm-to-find-minimum-number-of-coins/|Număr minim de monede - valori multiplu]] | |
| - | [2] Rucsac: [[http://www.infoarena.ro/metoda-greedy-si-problema-fractionara-a-rucsacului?revision=18]] | + | - [[http://www.geeksforgeeks.org/job-sequencing-problem-set-1-greedy-algorithm/|Alegere task-uri]] |
| - | + | - [[http://www.geeksforgeeks.org/greedy-algorithms-set-3-huffman-coding/|Coduri Huffman]] | |
| - | [3] Număr minim de monede: [[http://geeksquiz.com/greedy-algorithm-to-find-minimum-number-of-coins/]] | + | |
| - | + | ||
| - | [4] Alegere task-uri: [[http://www.geeksforgeeks.org/job-sequencing-problem-set-1-greedy-algorithm/]] | + | |
| - | + | ||
| - | [5] Huffman Coding: [[http://www.geeksforgeeks.org/greedy-algorithms-set-3-huffman-coding/]] | + | |
| ===== Programare dinamică ===== | ===== Programare dinamică ===== | ||
| - | [1] Informații generale 1: [[https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/]] | + | - [[https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/|Informații generale 1]] |
| - | + | - [[https://www.codechef.com/wiki/tutorial-dynamic-programming|Informații generale 2]] | |
| - | [2] Informații generale 2: [[https://www.codechef.com/wiki/tutorial-dynamic-programming]] | + | - [[http://www.geeksforgeeks.org/count-ways-reach-nth-stair/|Problema treptelor]] |
| - | + | - [[http://www.geeksforgeeks.org/count-number-binary-strings-without-consecutive-1s/|Șiruri binare fără elemente consecutive de 1]] | |
| - | [3] Problema treptelor: [[http://www.geeksforgeeks.org/count-ways-reach-nth-stair/]] | + | - [[http://www.geeksforgeeks.org/dynamic-programming-set-3-longest-increasing-subsequence/|Cel mai lung subșir crescător]] |
| - | + | - [[http://www.geeksforgeeks.org/dynamic-programming-set-14-maximum-sum-increasing-subsequence/|Variațiune a celui mai lung subșir crescător]] | |
| - | [4] Șiruri binare fără elemente consecutive de 1: [[http://www.geeksforgeeks.org/count-number-binary-strings-without-consecutive-1s/]] | + | - [[http://www.geeksforgeeks.org/dynamic-programming-set-7-coin-change/|Număr posibilități de rest în monede]] |
| - | + | - [[http://www.geeksforgeeks.org/find-minimum-number-of-coins-that-make-a-change/|Număr minim de monede - varianta nesimplificată]] | |
| - | [5] Rest în monede: [[http://www.geeksforgeeks.org/dynamic-programming-set-7-coin-change/]] | + | - [[http://www.geeksforgeeks.org/dynamic-programming-set-4-longest-common-subsequence/|Cel mai lung subșir comun]] |
| - | + | ||
| - | [6] Cel mai lung subșir crescător: [[http://www.geeksforgeeks.org/dynamic-programming-set-3-longest-increasing-subsequence/]] | + | |
| - | + | ||
| - | [7] Variațiune a celui mai lung subșir crescător: [[http://www.geeksforgeeks.org/dynamic-programming-set-14-maximum-sum-increasing-subsequence/]] | + | |
| - | + | ||
| - | [8] Cel mai lung subșir comun: [[http://www.geeksforgeeks.org/dynamic-programming-set-4-longest-common-subsequence/]] | + | |
| - | + | ||
| - | [9] Distanța de editare: [[http://www.geeksforgeeks.org/dynamic-programming-set-5-edit-distance/]] | + | |
| ===== Backtracking ===== | ===== Backtracking ===== | ||
| - | [1] Permutări ale unui șir: [[http://www.geeksforgeeks.org/write-a-c-program-to-print-all-permutations-of-a-given-string/]] | + | - [[http://www.geeksforgeeks.org/write-a-c-program-to-print-all-permutations-of-a-given-string/|Permutări ale unui șir]] |
| - | + | - [[http://www.geeksforgeeks.org/backtracking-set-3-n-queen-problem/|Problema damelor]] | |
| - | [2] Problema damelor: [[http://www.geeksforgeeks.org/backtracking-set-3-n-queen-problem/]] | + | - [[http://www.geeksforgeeks.org/backttracking-set-2-rat-in-a-maze/|Rat in a maze]] |
| - | + | - [[http://www.geeksforgeeks.org/backttracking-set-5-m-coloring-problem/|Problema colorării]] | |
| - | [3] Rat in a maze: [[http://www.geeksforgeeks.org/backttracking-set-2-rat-in-a-maze/]] | + | |
| - | + | ||
| - | [4] Problema colorării: [[http://www.geeksforgeeks.org/backttracking-set-5-m-coloring-problem/]] | + | |
