Search:

I can't figure out where it would help sth like that.
Can u be more specific?

I mean the 1st code example works great as a typical bubblesort, but the 2nd one that tries to behave circular...

Hello!!



void bubblesort(int n, double *x)
{ int i, j;
for (i=1 ; i<=n-1 ; i++)
for (j=n-1 ; j>=i ; j--)
if (x[j-1] > x[j])
swapd(&x[j-1], &x[j]);