Laborator 4. Rezolvări

Transcription

1 Programare Delphi Exerciţiul 1. Quicksort cu pivotul pe stânga program Rezoli_1; {$APPTYPE CONSOLE} n = 13; Laborator 4. Rezolvări a: vector = (1, 51, 2, 4, 9, 100, 15, 6, 0, 8, 19, 10, 11); procedure schimba( x, y: integer); aux: integer; aux := x; x := y; y := aux; // initial pivotul=stg si iproviz=drp // impartim si rearanjam subtabloul [stg..drp] in // [stg..][iproviz..drp] // astfel incat // elementele din [stg..] sa fie < valoarea pivotului // elementele din [iproviz..drp] sa fie >= valoarea pivotului // la final mutam pivotul pe locul provizoriu procedure combina(stg, mij, drp: integer); procedure rezolvadirect(stg, drp: integer); valpivot, iproviz, valpivot := a[stg]; // pivotul este initial in stg iproviz := drp; for i := drp downto stg+1 do if a[i] >= valpivot then // mutam a[i] in dreapta schimba(a[i], a[iproviz]); iproviz := iproviz - 1 schimba(a[iproviz], a[stg]); // mutam pivotul pe locul final exit(iproviz); 1

2 procedure rezolva(stg, drp: integer); med: integer; if drp <= stg then rezolvadirect(stg, drp) med := divide(stg, drp); rezolva(stg, med - 1); rezolva(med + 1, drp); combina(stg, med, drp); rezolva(1, n); for i := 1 to n do write(a[i]:4); Writeln; 2

3 Exerciţiul 2. Sortare prin interclasare program MergeSort; {$APPTYPE CONSOLE} // sortare cu interclasare n = 14; a: vector = (10, 11, 5, 70, 31, 40, -4, 5, 6, 0, 8, 9, 10, 11); reg: vector; procedure combina(stg, mij, drp: integer); i, istg, idrp: integer; // if(tab[mij]<=tab[mij+1]) then Exit; i := stg; istg := stg; idrp := mij + 1; while (istg <= mij) and (idrp <= drp) do if a[istg] <= a[idrp] then reg[i] := a[istg]; Inc(istg); end reg[i] := a[idrp]; Inc(idrp); while (istg <= mij) do // daca au mai ramas in stg reg[i] := a[istg]; Inc(istg); while (idrp <= drp) do // daca au mai ramas in drp reg[i] := a[idrp]; Inc(idrp); for i := stg to drp do a[i] := reg[i]; 3

4 procedure rezolvadirect(stg, drp: integer); aux: integer; if a[stg] > a[drp] then aux := a[stg]; a[stg] := a[drp]; a[drp] := aux; result:=(stg+drp) div 2; procedure rezolva(stg, drp: integer); med: integer; if drp <= stg + 1 then rezolvadirect(stg, drp) med := divide(stg,drp); rezolva(stg, med); rezolva(med + 1, drp); combina(stg, med, drp); rezolva(1, n); for i := 1 to n do write(a[i]:4); Writeln; 4

5 Exerciţiul 3. Calculul sumelor program Rezoli_3; {$APPTYPE CONSOLE} //suma prin divide et impera n = 11; a: vector = (100, 200, 35, 40, 555, 61, 77, 81, 200, 340, 111); function combina(solstg, soldrp: integer): integer; result := solstg + soldrp; function rezolvadirect(stg, drp: integer): integer; result := a[stg]; result := (stg + drp) div 2; function rezolva(stg, drp: integer): integer; med, sumstg, sumdrp: integer; if stg = drp then result := rezolvadirect(stg, drp) med := divide(stg, drp); sumstg := rezolva(stg, med); sumdrp := rezolva(med + 1, drp); result := combina(sumstg, sumdrp); min: integer; Writeln(rezolva(1, n)); 5

6 Exerciţiul 5. Evaluarea polinoamelor. program EvalPolinoame; {$APPTYPE CONSOLE} // Evaluarea polinoamelor n = 5; a: vector = (1, -2, 3, 5, 3); function putere(m: integer; x: double): double; result := 1; for i := 1 to m do result := result * x; function combina(m: integer; solstg, soldrp, x: double): double; result := solstg + putere(m, x) * soldrp; function rezolvadirect(stg, drp: integer; x: double): double; result := a[stg]; result := (stg + drp) div 2; function rezolva(stg, drp: integer; x: double): double; med: integer; solstg, soldrp: double; if drp = stg then result := rezolvadirect(stg, drp, x) med := divide(stg, drp); solstg := rezolva(stg, med, x); soldrp := rezolva(med + 1, drp, x); result := combina(med - stg + 1, solstg, soldrp, x); 6

7 function Horner(stg, drp: integer; x: double): double; result := 0; for i := drp downto stg do result := a[i] + x * result; x: double; x := 1.2; Writeln(rezolva(1, n, x):0:6); Writeln(Horner(1, n, x):0:6); 7