2021-07-21

void fun(char (*ss)[M])
{ char *ps[N],*tp; int i,j,k;
for(i=0; i<N; i++) ps[i]=ss[i];
for(i=0; i<N-1; i++) {
/found/
k= i ;
for(j=i+1; j<N; j++)
/found/
if(strlen(ps[k]) < strlen(ps[j]) ) k=j;
/found/
tp=ps[i]; ps[i]=ps[k]; ps[k]= tp ;
}
printf("\nThe string after sorting by length:\n\n");
for(i=0; i<N; i++) puts(ps[i]);
}

/found/
double fun(int n)
{double sum, s0, s1, s2, s; int k;
sum=1.0;
if (n<=2) sum=0.0;
s0=0.0; s1=0.0; s2=1.0;
for (k=4;k<=n;k++)
{ s=s0+s1+s2;
sum+=sqrt(s);
s0=s1;s1=s2;s2=s;
}
/found/
return sum;
}

double fun(double x, int n)
{
int i;
double s=1.0,s1=1.0;
for(i=1;i<=n;i++)
{
s1=s1*i;
s=s+pow(x,i)/s1;
}
return s;
}