Curs 3 - Agenda - Profs.info.uaic.ro

More documents

Recommendations

Info

Subprograme recursive subprogramul f() apeleaza direct subprogramul g() daca blocul care defineste f() include un apel al lui g() subprogramul f() apeleaza indirect subprogramul g() daca f() apeleaza direct un subprogram h() si h() apeleaza direct sau indirect g() f() este definit recursiv daca se autoapeleaza direct sau indirect Dorel Lucanu Algoritmica si programare
Subprograme recursive: Fibonacci function fibRec(n) if (n
Page 1: Curs 3 - A
Page 5 and 6: Functii recursive: conversie binara
Page 7 and 8: Functii recursive: turnurile din Ha
Page 9 and 10: Arbori binari: exemplu C E G K A M
Page 11 and 12: ArbBin: operatii insereaza() • i
Page 13 and 14: ArbBin: eliminare elimina() • in
Page 15 and 16: ArbBin :parcurgere preordine parcu
Page 17 and 18: ArbBin :parcurgere inordine parcur
Page 19 and 20: ArbBin: parcurgere postordine parc
Page 21 and 22: ArbBin: parcurgere BFS - exemplu C
Page 23 and 24: ArbBin : structura unui nod un nod
Page 25 and 26: Arbori binari: implementarea parcur
Page 27 and 28: Aplicatie: expresii intregi Expres
Page 29 and 30: Expresiile reprezentate ca arbori -
Page 31 and 32: Coada cu prioritati: tip de data ab
Page 33 and 34: maxHeap arbori binari completi cu
Page 35 and 36: maxHeap: inserarea 12 10 9 8 7 1 3
Page 37 and 38: maxHeap: inserare procedure inserea
Page 39 and 40: maxHeap: timp de executie inaltime
Page 41 and 42: Colectii de multimi disjuncte: “u

Curs 3 - Agenda - Profs.info.uaic.ro

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?