int foo (int A[], int left, int right) { int i, x, q, N; if (right < = left) return 1; x = 0; for (i=left; i < = right; i++) x + = A[i] % 2; / / busy work ... N = right-left+1; q = left + (N/3); return x + foo (A, left, q) + foo (A, q+1, right);
Answers (1)