Click here to load reader

Str 1 Intro Algoritmi 4f

  • View
    154

  • Download
    0

Embed Size (px)

Text of Str 1 Intro Algoritmi 4f

Algoritmi si Structuri de date

Cuprins (Structuri elementare):

Structuri lineare in alocare statica in alocare dinamica - liste structuri lineare cu restrictii la i/o: stive si cozi Structuri arborescente arbori oarecari arbori binari cautare folosind arbori binari Sortari interne Arbori binari stricti. Aplicatii.

Conf. Dr. Rodica Ceterchi Structuri de date si algoritmi: aspecte matematice si aplicatii, Ed. Univ. Buc. 2001

Cuprins (alta abordare):

tipuri de date structurate lineare ne-lineare: arbori si grafuri tehnici de sortare clasa algoritmilor de sortare bazati pe comparatii intre chei sortare prin interclasare (merging) alte tipuri de sortari tehnici de cautare cautare lineara cautare bazata pe comparatii intre chei. structuri arborescente pt. cautare: arbori binari de cautare, arbori binari de cautare echilibrati AVL, tabele de dispersie alte structuri

ALGORITHMS + DATA STRUCTURES = PROGRAMS

(N. Wirth, 1976)

avem de reprezentat multimi (finite, de date omogene)

statice - componenta nu se schimba in timp dinamice - componenta se schimba in timp

multimi pe care facem diverse operatii in scopul rezolvarii unor probleme

AlgoritmiAlgorithm = well-defined computational procedure that Takes some value/set of values as input, and Produces some value/set of values as output (computational) Problem = a desired input/output relationship, specified in general terms Algorithm = tool for solving a problem = computational procedure which achieves the desired input/output relationship

Example of Problem: sortingInput: a sequence (a1, a2, , an) Output: a permutation p of the set {1,,n} such that in (ap(1), ap(2), , ap(n)) we have ap(1)

Search related