In tabelul de mai jos se afla cei mai importanti algoritmi care trebuie sa se gaseasca sub forma de probleme in arhiva educationala. Pentru fiecare problema este trecut si un responsabil. Responsabilul pe problema va fi cel care s-a oferit prin voluntariat sa o introduca in arhiva. El va fi cel care va scrie enuntul, va crea testele si eventual un evaluator.

*Tabelul este in proces de completare!*

Puteti veni oricand cu propuneri si sugestii de probleme noi pe "forum":forum/index.php?topic=2753.msg22505#new!
 

%{color:red} Nu va apucati de lucru pana nu sunteti informati despre modul in care se baga problemele!%

table(example). |_. Denumire problema |_. Categorie|_. Responsabil |_. Stare|
|Algoritmul lui Euclid|Matematica|== user(user="filipb" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul lui Euclid extins|Matematica|-|==Stars(rating="0" scale="1" type="small")==|
|Cel mai lung subsir comun|Programare dinamica|== user(user="filipb" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Cel mai lung subsir crescator|Programare dinamica|== user(user="Florian" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Knapsack|Programare dinamica|== user(user="gabitzish1" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Cautare binara|?|== user(user="Florian" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Parcurgere BFS|Grafuri|== user(user="Florian" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Parcurgere DFS - componente conexe|Grafuri|== user(user="gabitzish1" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Componente biconexe|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Componente tare-conexe|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Sortare topologica|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Lant hamiltonian|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Ciclu eulerian|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul lui Prim|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul lui Kruskal|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul lui Djikstra|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul Floyd-Warshall|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul Bellman-Ford|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul Roy-Floyd|Grafuri|== user(user="gabitzish1" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Flux maxim|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Flux maxim de cost minim|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim de cost minim|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Lowest Common Ancestor|Grafuri|-|==Stars(rating="0" scale="1" type="small")==|
|Potrivirea sirurilor|Siruri de caractere|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de sufixe|Siruri de caractere|-|==Stars(rating="0" scale="1" type="small")==|
|Trie|Siruri de caractere|-|==Stars(rating="0" scale="1" type="small")==|
|Heapuri|Structuri de date|-|==Stars(rating="0" scale="1" type="small")==|
|Hashuri|Structuri de date|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de intervale|Structuri de date|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de indexati binar|Structuri de date|-|==Stars(rating="0" scale="1" type="small")==|
|Range Minimum Query|Structuri de date|-|==Stars(rating="0" scale="1" type="small")==|
|Double ended queue (deque)|Structuri de date|-|==Stars(rating="0" scale="1" type="small")==|
|Structuri de multimi disjuncte|Structuri de date|-|==Stars(rating="0" scale="1" type="small")==|
|Punct in poligon|Geometrie|-|==Stars(rating="0" scale="1" type="small")==|
|Infasuratoare convexa|Geometrie|-|==Stars(rating="0" scale="1" type="small")==|
|Diagrame Voronoi|Geometrie|-|==Stars(rating="0" scale="1" type="small")==|

_Matematica:_
 
table(example). |_. Denumire problema|_. Responsabil|_. Finalizat|
|Algoritmul lui Euclid|== user(user="filipb" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul lui Euclid extins|-|==Stars(rating="0" scale="1" type="small")==|
 
_Programare dinamica:_
 
table(example). |_. Denumire problema|_. Responsabil|_. Finalizat|
|Cel mai lung subsir comun|== user(user="filipb" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Cel mai lung subsir crescator|== user(user="Florian" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Knapsack|== user(user="gabitzish1" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
 
_Algoritmi pe grafuri:_
 
table(example). |_. Denumire problema|_. Responsabil|_. Finalizat|
|Parcurgere BFS|== user(user="Florian" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Parcurgere DFS - componente conexe|== user(user="gabitzish1" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Componente biconexe|-|==Stars(rating="0" scale="1" type="small")==|
|Componente tare-conexe|-|==Stars(rating="0" scale="1" type="small")==|
|Sortare topologica|-|==Stars(rating="0" scale="1" type="small")==|
|Lant hamiltonian|-|==Stars(rating="0" scale="1" type="small")==|
|Ciclu eulerian|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul lui Prim|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul lui Kruskal|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul lui Djikstra|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul Floyd-Warshall|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul Bellman-Ford|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmul Roy-Floyd|== user(user="gabitzish1" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Flux maxim|-|==Stars(rating="0" scale="1" type="small")==|
|Flux maxim de cost minim|-|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim|-|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim de cost minim|-|==Stars(rating="0" scale="1" type="small")==|
|Lowest Common Ancestor|-|==Stars(rating="0" scale="1" type="small")==|
 
_Siruri de caractere:_
 
table(example). |_. Denumire problema|_. Responsabil|_. Finalizat|
|Potrivirea sirurilor|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de sufixe|-|==Stars(rating="0" scale="1" type="small")==|
|Trie|-|==Stars(rating="0" scale="1" type="small")==|
 
_Structuri de date:_
 
table(example). |_. Denumire problema|_. Responsabil|_. Finalizat|
|Heapuri|-|==Stars(rating="0" scale="1" type="small")==|
|Hashuri|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de intervale|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de indexati binar|-|==Stars(rating="0" scale="1" type="small")==|
|Range Minimum Query|-|==Stars(rating="0" scale="1" type="small")==|
|Double ended queue (deque)|-|==Stars(rating="0" scale="1" type="small")==|
|Structuri de multimi disjuncte|-|==Stars(rating="0" scale="1" type="small")==|
 
_Geometrie:_
 
|Punct in poligon|-|==Stars(rating="0" scale="1" type="small")==|
|Infasuratoare convexa|-|==Stars(rating="0" scale="1" type="small")==|
|Diagrame Voronoi|-|==Stars(rating="0" scale="1" type="small")==|
 
_Diverse:_
 
table(example). |_. Denumire problema|_. Responsabil|_. Finalizat|
|Cautare binara|== user(user="Florian" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

Mentionam faptul ca anumiti algoritmi pot fi implementati in complexitati diferite. De exemplu, pentru algoritmul de drumuri minime al lui Djikstra exista atat o solutie de complexitate {$O(N^2^)$}, cat si o solutie {$O(M log{~2~} N)$}. In acest caz, propunem sa nu se faca doua probleme diferite, ci sa se diferentieze punctajul in functie de rezolvare. Diferentierea pentru diferite abordari (complexitati) va fi precizata clar in enunt la rubrica de restrictii. De exemplu: "Un algoritm de complexitate {$O(N^2^)$} obtine $50$ de puncte", "Algoritmul Ford-Fulkerson obtine 30 de puncte. Pentru punctaj maxim este necesara implementarea algoritmului lui Dinic.".