2 * O(nlog n) work algorithm (Hillis-Steele)
6 void algorithm (numtype x[], unsigned long size, unsigned int ops[]) {
12 for(k=1; k < size; k <<=1){
13 printf ("hier.%li\n", k);
14 for(i = k; i < size; i++){
15 printf (" da.%li\n",i);
21 /* Copy out array to in */
22 // for (i = 0; i < size; i++){