> #include #include #include #include struct arb { int info; struct arb *st,*dr; }*arbore; void creare(arb * aux, int as) { arb * ax; if(asinfo) if(au...
>Generarea permutarilor – backtracking recursiv
> #include #include #include int k,n,st[90];void tipar(int k){cout<<"n"; for(int i=1;i<k;i++) cout<<st[i]<<" ";}int valid(int k){...
>Copy TMemo content into clipboard
>Place a button on your form and add the following code:Memo1.SelectAll;Memo1.CopyToClipboard;
>Cum se calculeaza speedup-ul
>In calculul paralel, speedup-ul se refera la cat de rapid este un algoritm paralelizat fata de un algoritm secvential (clasic).Formula pentru calculu...