int main()
{
int A[max], B[max];
int na, nb;
upis(A, &na);
upis(B, &nb);
zamena(A, na);
zamena (B, nb);
ispis(A, na);
ispis(B, nb);
int q; //elemenat koji ubacujemo
int x; //mesto na koje ga ubacujemo
ubacivanjeelementa (A, &na, &q, &x);
ispis(A, na);
int C[max], nc;
fuzija1 (A, na, B, nb, C, &nc);
fuzija2 (A, &na, B, nb);
ispis(C, nc);
ispis(A, na);
ispis(B, nb);
ubacivanjeniza (B, &nb, A, na, &x);
ispis(B, nb);
return 0;
}
void maxzam(double **a, double *b, int k, int m)
{
int i, p;
double max = 0;
for (i = k;i <= m;i++)
{
if (fabs(a[i][k]) > max)
{
max = fabs(a[i][k]);
p = i;
}
}
if (max == 0)printf("net resheniy");
else
zamena(a, b, p, k, m);
}
