Re-arrange the odd/even to odd/even places

Given an array of integers [3,1,4,5,7,6,10,8],
re arrange elements such that either even numbers in even locations or odd numbers in odd locations.
in O(n)

output :  6 1 4 5 8 3 10 7

#include<stdio.h>

void Swap (int A[], int i, int j)
{
    int temp = A[i];
    A[i]=A[j];
    A[j]=temp;
}

int main()
{
    int A[] = {3,1,4,5,7,6,10,8};
    int i=0,j=1,n;
    n=sizeof(A)/sizeof(int);
    while(i<n)
    {
        while(i<n && A[i]%2 == 0)
            i+=2;
        while(j<n && A[j]%2 == 1)
            j+=2;
        if(i<n && j<n)
            Swap(A,i,j);
    }// end of while

    for(i=0;i<n;i++)
        printf(" %d",A[i]);

return 0;
}

Let me know your thoughts

Sort an Array of 0 1& 2 in one pass

 Given an array int a[] = {0, 1, 1 ,0, 2, 2, 1, 0 ,1, 2, 1,0 }
to be converted into {0, 0, 0, 0, 1, 1, 1, 1, 1 ,2 ,2 ,2}
inplace and single pass

Input :  int A[] = {2,2,2,1,1,1,0,0,0,1,2,0};
Output:  0 0 0 0 1 1 1 1 2 2 2 2

#include<stdio.h>

int main()
{
    int A[] = {2,2,2,1,1,1,0,0,0,1,2,0};
    int j,i,x,y,n,t=A[0];
    n=sizeof(A)/sizeof(A[0]);
printf("Size of array : %d\n",n);
    for(x=i=0,y=j=n-1;i<=j;)
    {
        if(t==0)
        {
            A[x]=0;
            x++;
            i++;
            t=A[i];
        }
        else if(t==2)
        {
            t=A[y];
            A[y]=2;
            y--;
            j--;
        }
        else
        {
            i++;
            t=A[i];
        }
    }

    while(x<=y)
    {
        A[x++]=1;
    }

    for(i=0;i<n;i++)
    {
        printf(" %d",A[i]);
    }
return 0;
}

Let me know your thoughts.