Нужно описать что делают проги

struct xxx { int v; xxx *p[4]; };

int F1(xxx *q)

{ int i,n,m;

if (q==NULL) return 0;

for (n=F1(q->p[0]),i=1; i< 4; i++)

     if ((m=F1(q->p[i])) >n) n=m;

return n+1; }

//-------------------------------------------------------2

struct zzz { int v; zzz *l,*r; };

int F2(zzz *p) {

if (p==NULL) return(0);

return (1 + F2(p->r) + F2(p->l)); }






4 Динамическое связывание




double F1(double a, double b, double (*pf)(double))

{ double m;

if ((*pf)(a) * (*pf)(b) > 0 )return(a);

     while ( b-a > 0.0001 ) {

     m = (b + a)/2;

     if ((*pf)(a) * (*pf)(m) < 0) b=m; else a=m;

     }

return a ;}

//------------------------------------------------------- 2

double F2(double x, double s0, double (*pf)(double,int))

{ double s; int n;

for (n=1, s=0.0; fabs(s0) > 0.0001; n++)

     { s += s0; s0 = s0 * (pf)(x,n); }

return s; }

double ff(double x, int n) { return( x/n); }

void main1()

{ double x,y; y = F2(x,1,ff); }




5//------------------------------------------------------ 1

struct man {char name[20]; int dd,mm,yy; char *addr; };

char *F1(char *p, char *nm, char *ad)

{ man *q =(man*)p;

strcpy(q->name,nm);

strcpy((char*) (q+1 ),ad);

q->addr = (char*) (q+1 );

for (p=(char*) (q+1 ); *p!=0; p++);

p++; return p;}

//------------------------------------------------------ 2

struct man1 {char name[20]; int dd,mm,yy; char addr[]; };

char *F2(char *p, char *nm, char *ad)

{ man1 *q =(man1*)p;

strcpy(q->name,nm);

strcpy(q->addr,ad);

for (p=q->addr; *p!=0; p++);

p++; return p;}