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