2 * Recursive parallel prefix with auxiliary array y
6 void algorithm (numtype x[], unsigned long n, unsigned int ops[]) {
13 for (i=0; i < (n/2); i++) {
14 y[i] = x[2*i] + x[2*i+1];
17 algorithm(y, n/2, ops);
20 for (i = 1; i < (n/2); i++){
21 x[2*i] = y[i-1] + x[2*i];
25 x[n-1] = y[n/2-1] + x[n-1];