> //parcurgere matrice Snake#include <stdio.h>#include <conio.h>#include <math.h>void citire(int m, int n, int a[20][20],char c){for...
>Desenare linie folosind algoritmul Bresenham
> #include <graphics.h>#include <stdlib.h>#include <stdio.h>#include <conio.h>#include <iostream.h>#include <math.h&g...
>Fabrica de masini – raspunsuri intrebari
>Aici veti gasi raspunsuri la unele din intrebarile din Fabricademasini.ro Intrebare Raspuns ANI 1. In ce an a fost lansata Dacia 1300 Break? 1973 2. ...
>Complexitati algoritmi
>Complexitatea unor algoritmi cunoscuti: Cautare liniara O(n) Cautare binara O(log n) Sortare prin interschimbare O(n2) Sortare prin selectie O(n2) So...
>Creare arbore binar
> #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...