47 int *location=(
int *)malloc(
sizeof(
int)*n);
51 printf(
"\n Allocation of array failure!");
67 printf(
"\n n=%d should be an integer over 1!",n);
89 x[i]=(u[i] + x[i+1]*num)/(num+1);
90 location[i]=location[i+1];
98 x[i]=( x[i]* (j-i) + x[j]* num ) / (location[j] -i +1);
99 location[i]=location[j];
122 for(j=i+1;j<=location[i];j++){
149 double sum,
max, mean;
151 int *location=(
int *)malloc(
sizeof(
int)*n);
155 printf(
"\n Allocation of array failure!");
206 for(j=i+1;j<=location[i];j++){
void sequence_bottomup(double *x, double *u, int n)
void sequence_topdown(double *x, double *u, int n)
Matrix::Scalar max(Matrix m)