C语言中关于排序问题（一冒泡排序）

#include<stdio.h>

void print(int *ptr,int num);

void sort1(int *ptr,int num);

int main(void)

{

    int ar[]={su,};

    int num;

    num = sizeof(ar) / sizeof(ar[0]);

    print(ar,num);

   sort1(ar,num);

   print(ar,num);

return 0;

}

void print(int *ptr,int num)

{

  int i;

  for(i = 0 ;i < num; i++)

   {

        printf("%d ",ptr[i]);

    }

    printf("\n");

}

void sort1(int *ptr,int num)

{

   int i,j;

   int isok = 1;

   int cnt = 0;

   for(i = 0;i < (num-1);i++)

      {

          isok = 1;

          for(j = 0;j < (num - i - 1);j++)

            {

                 if(ptr[j] > ptr[j+1])

                     {

                         prt[j]         ^= ptr[j+1];

                         ptr[j+1]    ^= ptr[j];

                         ptr[j+1]    ^=ptr[j];

                     }

                     cnt++;

             }

            if(isok == 1)

             {

                    break;

              }

      }

      printf("cnt = %d\n",cnt);     

}