/* сортировка слиянием */ double *smerge (double *s, int m, int n) { int l,low,up; double *merge (double *, int, int, int); l=1; while(l<=(n-m)) { low="m;" up="m-1;" while (l+up < n) { up="(low+2*l-1" < n) ? (low+2*l-1) : n ; merge (s,low,up,l); low="up-1;" } l*="2;" } return(a); }