graph dependencies

Hi, I have this piece of code that I would like to take eliminate dependencies. Can someone point me in the right direction ?

for (i=0; i < m; i++)
{
n1 = n2;
n2 = n2 + n2;
e = -6.283185307179586/n2;
a = 0.0;


for (j=0; j < n1; j++)
{
c = cos(a);
s = sin(a);
a = a + e;


for (k=j; k < n; k=k+n2)
{

{
t1 = c*x[k+n1] - s*y[k+n1];
t2 = s*x[k+n1] + c*y[k+n1];
x[k+n1] = x[k] - t1;
y[k+n1] = y[k] - t2;
x[k] = x[k] + t1;
y[k] = y[k] + t2;
}

}
}
}
- lack of code tags: check
- undescriptive 1-letter variable names: check
- no comments: check
- vague explanation of the problem: check
- arrays of unknown size: check
- no hint as to what the code is trying to accomplish: check

... processing your request ...



...
...


Huh?
Last edited on
Topic archived. No new replies allowed.