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

More documents

Recommendations

Info

Fibonacci – nerecursiv function fib(n) if (n
Functii recursive: conversie binara p<strong>ro</strong>cedure convert(x) 1.if (x != 0) 2.then convert(x/2) 3. print(x % 2) } convert(12) convert(6) convert(3) 1100 110 11 0 1 3 3 3 6 3 12 3 x adr.retur convert(1) convert(0) 1 ─ Dorel Lucanu Algoritmica si p<strong>ro</strong>gramare stiva arborele apelurilor
Page 1 and 2: Curs 3 - A
Page 3: Subprograme recursive: Fibonacci fu
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

Create successful ePaper yourself

Delete template?

Save as template?