bubble sort

#include<stdio.h>
#include<conio.h>

int DATA[8]={32,51,27,85,66,23,13,57};
int N=8;
void BUBBLE(void);
void main()
{
    int i;
    printf("Values contained in DATA[8]=");
    for(i=0;i<8;i++)
        printf(" %d",DATA[i]);
    BUBBLE();
    printf("\n\nValues contained in DATA[8] after sorting =");
    for(i=0;i<8;i++)
        printf(" %d",DATA[i]);
    getch();
}
void BUBBLE(void)
{
    int K,PTR,TEMP;
    for(K=0;K<=(N-1-1);K++)
    {
        PTR=0;
        while(PTR<=(N-K-1-1))
        {
            if(DATA[PTR]>DATA[PTR+1])
            {
                TEMP=DATA[PTR];
                DATA[PTR]=DATA[PTR+1];
                DATA[PTR+1]=TEMP;
            }
            PTR=PTR+1;
        }
    }
}