Divide et impera procedure merge_sort(sir,i,n) if sir[i]>sir[n] aux=sir[i] sir[i]=sir[j] sir[j]=aux else merge_sort(i,n/2) merge_sort(n,2+1,n) procedure divide et impera(p,n,S) begin

if(n<=n0)then rezolva/determina p prin metode elimentare else imparte p in p1,p2,..,Pa DivideEtImpera(p1,n1,S1) DivideEtImpera(p2,n2,S2) ...................... DivideEtImpera(pa,na,Sa) End

void ordoneaza(int i, int n) { if v[i]>v[n] aux=v[i]; v[i]=v[n]; swap(s[i],s[n]) v[n]=aux; else ordoneaza(i,n/2); ordoneaza(n/2+1,n); }

marimea unui arbore partial function len_max for(int i=1,i<n,i++) for(int j=1,j<n,j++) if (a[i][j]>maxim) maxim= a[i][j] return maxim;

"cel m mare element" determina (int n) int v=0; {if |i==n| return i; else if(v[i]<v[n]){k=n; determina (i+1,n)} else determina (i,n-1) } determina(int i, int n) {int k=0; if (i==n) return i; else v<1,2,..,k=n determina max subarbore dr/stg}