Академический Документы
Профессиональный Документы
Культура Документы
int prim(int x)
{
if (x == 2) return 1;
if (x < 2) return 0;
if (x % 2 == 0) return 0;
int a = 0;
int b = 1;
int c = a + b;
vector[index] = a;
a = b;
b = c;
c = a + b;
while (a != b)
if (a > b)
a = a - b;
else b = b - a;
int s = 0;
do {
int aux = 0;
while (a)
aux+= a % 10;
a /= 10;
s = aux;
a = s;
} while (s >9);
a = s;
int divizor = 2;
int putere = 0;
while (numar%divizor == 0)
putere++;
numar /= divizor;
if(putere!=0)
divizor++;
Interschimbare
int i = 0, j = 0;
while (i < dimensiune1 && j < dimensiune2)
{
if (Vector1[i] < Vector2[j])
{
Vector_ordonat[k] = Vector1[i];
k++;
i++;
}
else
if(Vector1[i]== Vector2[j])
{
Vector_ordonat[k] = Vector2[j];
k++;
j++;
i++;
}
else
{
Vector_ordonat[k] = Vector2[j];
k++;
j++;
}
}
if (i <= dimensiune1)
{
for (int p = i; p < dimensiune1; p++)
{
Vector_ordonat[k] = Vector1[p];
k++;
}
}
if (j <= dimensiune2)
{
for (int p = j; p < dimensiune2; p++)
{
Vector_ordonat[k] = Vector2[p];
k++;
}
}
for (int p = 0; p < k; p++)
std::cout << Vector_ordonat[p] << " ";
Bubblesort sortare
while(ok==0)
{
ok = 1;
for (int index = 0; index < dim - 1; index++)
if (v[index] > v[index + 1])
{
int aux = v[index];
v[index] = v[index + 1];
v[index + 1] = aux;
ok = 0;
}
}
}
Sort
std::sort(vector, vector+dimensiune);
Quicksort
while (i <= j)
{
while (vector[i] < pivot)
i++;
while (vector[j] > pivot)
j--;
if (i <= j)
{
tmp = vector[i];
vector[i] = vector[j];
vector[j] = tmp;
i++;
j--;
}
}
if (left < j)
quickSort(vector, left, j);
if (i < right)
quickSort(vector, i, right);
}
while (i<=j)
{
while (vector[i] > pivot)
i++;
while (vector[j] < pivot)
j--;
if (i <= j)
{
tmp = vector[i];
vector[i] = vector[j];
vector[j] = tmp;
i++;
j--;
}
}
if (left < j)
quickSort_descrescator(vector, left, j);
if (i < right)
quickSort_descrescator(vector, i, right);
}
Matrice
void citire(int mat[10][10], int &n, int &m)
{
std::cout << "Numarul de linii = "; std::cin >> n;
std::cout << "Numarul de coloane = "; std::cin >> m;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
{
std::cout << "a[" << i << "," << j << "]= ";
std::cin >> mat[i][j];
}
}
Matrice patratica
void produs(int mat1[10][10], int mat2[10][10], int matp[10][10], int n, int m, int p)
{
m--;
}
Linie==0; f=========================================================================
if (cautareBinara(vector, n, x) != -1)
pozitie = dimensiune + 1;
pozitie = 1;
pozitie = mijloc + 1;
break;
inceput = mijloc + 1;
sfarsit = mijloc - 1;
int pozitie;
dimensiune++;
vector[pozitie] = element;
int pozitie;
dimensiune--;
}
Sortare prin insertie cu cautare binara
void sortare_inserare(int n, int v[])
{
QUICKSORT
int tmp;
while (i <= j)
i++;
j--;
if (i <= j)
tmp = vector[i];
vector[i] = vector[j];
vector[j] = tmp;
i++;
j--;
if (left < j)
quickSort(vector, left, j);
if (i < right)
quickSort(vector, i, right);
Sortare matrice
int k = 0;
// into temp[]
temp[k++] = mat[i][j];
// sort temp[]
// in mat[][]
k = 0;
mat[i][j] = temp[k++];
max = m[lin][col];
iMax = a;
jMax = b;
std::cout << "este " << max << " de pe pozitia [" << iMax << "][" << jMax << "]\n";
void interclasare(int Vector1[], int dimensiune1, int Vector2[], int dimensiune2, int Vector_ordonat[], int &k)
int i = 0, j = 0;
Vector_ordonat[k] = Vector1[i];
k++;
i++;
else
if (Vector1[i] == Vector2[j])
Vector_ordonat[k] = Vector2[j];
k++;
j++;
i++;
else
{
Vector_ordonat[k] = Vector2[j];
k++;
j++;
if (i <= dimensiune1)
Vector_ordonat[k] = Vector1[p];
k++;
if (j <= dimensiune2)
Vector_ordonat[k] = Vector2[p];
k++;
vector[index] = elem;
index++;
nr++;
}
}