int main(){
int a[100],a2[100],a3[100],a4[100];
int len;
int i;
printf("Enter the length of the array : ");
scanf("%d",&len);
for(i = 0 ; i< len ; i++){
scanf("%d",&a[i]);
a2[i] =a3[i] = a4[i]=a[i];
}
sort_1(&a[0],len);
sort_2(&a2[0],len);
sort_3(&a3[0],len);
sort_4(&a4[0],len);
return 0;
}
void sortprog_1( char* host, int argc, char *argv[])
{
CLIENT *clnt;
double *result_1, *dp,*dp1, f;
char *endptr;
int i, j;
input_data sort_1_arg;
input_data *output;
sort_1_arg.input_data.input_data_val =(double*)malloc(MAXAVGSIZE*sizeof(double));
dp = sort_1_arg.input_data.input_data_val;
sort_1_arg.input_data.input_data_len = argc - 2;
for (i=1;i<=(argc - 2);i++)
{
f = strtod(argv[i+1],&endptr);
printf("value = %e\n",f);
*dp = f;
dp++;
}
clnt = clnt_create(host, SORTPROG, SORTVERS, "udp");
if (clnt == NULL) {
clnt_pcreateerror(host);
exit(1);
}
output= sort_1(&sort_1_arg, clnt);
printf("\nSorted Data : \n");
dp1=output->input_data.input_data_val;
for(j=1;j<=output->input_data.input_data_len;j++)
{ printf("%e \n ",*dp1);
dp1++;
}
clnt_destroy(clnt);
}
Array *sort_1_svc(Array *input,struct svc_req *svc)
{
CLIENT *c;
return (sort_1(input,c));
}
input_data *sort_1_svc(input_data *input,struct svc_req *svc)
{
CLIENT *client;
return(sort_1(input,client));
}
