Bubble sort final

#include<stdio.h>
int main()
{
    int bubble[8]={32,58,27,85,66,23,13,57};
    int n=8,j;
    for (j=0;j<n;j++)
    {
        printf("%d\t",bubble[j]);
    }
    int i,t;
    for(i=0;i<n-1;i++)
    {
        printf("\nPass: %d\n",i);
        int PTR=0;
        int k=n-1;
        while(PTR<k-i)
        {
            for (j=0;j<n;j++)
                {
                    printf("%d\t",bubble[j]);
                }
            if(bubble[PTR]>bubble[PTR+1])
            {
               printf(" Compare %d>%d Change\t",bubble[PTR],bubble[PTR+1]);
            }
            else
            {
                printf("Compare %d>%d No Change\t",bubble[PTR],bubble[PTR+1]);
            }
            printf("\n");
            if(bubble[PTR]>bubble[PTR+1])
            {
                t=bubble[PTR];
                bubble[PTR]=bubble[PTR+1];
                bubble[PTR+1]=t;
            }
            PTR=PTR+1;
        }
        printf("\n");

        for (j=0;j<n;j++)
                {
                    printf("%d\t",bubble[j]);
                }

    printf("\n\n");
    }
    printf("Final Sorting Elements:\t");
    for (j=0;j<n;j++)
                {
                    printf("%d\t",bubble[j]);
                }
    return 0;

}