This is an old revision of the document!
Articole
Divide et Impera
[1] Aplicații ale căutării binare: http://www.infoarena.ro/aplicatii-ale-cautarii-binare
[2] Căutare binară: http://geeksquiz.com/binary-search/
[3] Ridicarea la putere în timp logaritmic: http://www.geeksforgeeks.org/write-a-c-program-to-calculate-powxn/
[4] Găsirea numărului lipsă dintr-o progresie aritmetică: http://www.geeksforgeeks.org/find-missing-number-arithmetic-progression/
[5] Cele mai apropiate K elemente de o valoare dată: http://www.geeksforgeeks.org/find-k-closest-elements-given-value/
[6] Binary insertion sort: http://geeksquiz.com/binary-insertion-sort/
Greedy
[1] Informații generale: https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/
[2] Rucsac: http://www.infoarena.ro/metoda-greedy-si-problema-fractionara-a-rucsacului?revision=18
[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ă
[1] Informații generale 1: https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/
[2] Informații generale 2: https://www.codechef.com/wiki/tutorial-dynamic-programming
[3] Problema treptelor: http://www.geeksforgeeks.org/count-ways-reach-nth-stair/
[4] Șiruri binare fără elemente consecutive de 1: http://www.geeksforgeeks.org/count-number-binary-strings-without-consecutive-1s/
[5] Rest în monede: http://www.geeksforgeeks.org/dynamic-programming-set-7-coin-change/
[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
[1] Permutări ale unui șir: http://www.geeksforgeeks.org/write-a-c-program-to-print-all-permutations-of-a-given-string/
[2] Problema damelor: http://www.geeksforgeeks.org/backtracking-set-3-n-queen-problem/
[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/
