void Bubble_sort(int* p,int num)
{
    int i = 0;
    int tem = 0;
    int num1=num;
    int j = 0;
    for (j = 0; j < num; j++)
    {
        for (i = 0; i < num1; i++)
        {
             if (*(p+i) > *(p +i+ 1))
             {
                tem= *(p + i);
                *(p + i) = *(p + i + 1);
                *(p + i + 1)=tem;
             }
        }
        num1--;
    }
   
}
   
int num = 0;

int main()
{
    int arr[] = { 9,8,7,6,5,4,3,2,1,0 };
    num = sizeof(arr) / sizeof(arr[1]);
    Bubble_sort(arr,num);
    int i = 0;
    for (i = 0; i < 10; i++)
    {
        printf("%d ", arr[i]);
    }
    return 0;
}

为什么编译时会出现变量周围的堆栈已损坏？
void Bubble_sort(int* p,int num)是定义一个指针去接收，还是直接void Bubble_sort(int arr[],int num)就行了呢？为什么？

 for (i = 0; i < num1; i++)
        {
             if (*(p+i) > *(p +i+ 1))
             {
                tem= *(p + i);
                *(p + i) = *(p + i + 1);
                *(p + i + 1)=tem;
             }
        }

当 i=num1-1 时 i + 1=num1  致使*(p + i + 1)越界

逻辑上也存在问题
以下代码供参考

void Bubble_sort(int* p,int num)
{
   
        for (int i = 0; i < num-1; i++)
        {
            for (int j = i+1; j < num; j++)
           {
             if (p[i] > p[j])
             {
                int tem= p[i];
                 p[i] =  p[j];
                 p[j]=tem;
             }
           }
        }
   
}

int main()
{
    int arr[] = { 9,8,7,6,5,4,3,2,1,0 };
    int num = sizeof(arr) / sizeof(arr[1]);
    Bubble_sort(arr,num);
   
    for (int i = 0; i < 10; i++)
    {
        printf("%d ", arr[i]);
    }
    return 0;
}

原代码里，对数组操作越界，修改如下，供参考：

#include <stdio.h>
void Bubble_sort(int* p, int num)
{
    int i = 0;
    int tem = 0;
                                     //int num1 = num;
    int j = 0;
    for (j = 0; j < num - 1; j++)    //for (j = 0; j < num; j++)
    {
        for (i = 0; i < num - 1 - j; i++) //for (i = 0; i < num1; i++)
        {
            if (*(p + i) > *(p + i + 1))
            {
                tem = *(p + i);
                *(p + i) = *(p + i + 1);
                *(p + i + 1) = tem;
            }
        }
                                  //num1--;
    }

}
        //int num = 0;
int main()
{
    int arr[] = { 9,8,7,6,5,4,3,2,1,0 }, num;
    num = sizeof(arr) / sizeof(arr[1]);
    Bubble_sort(arr, num);
    int i = 0;
    for (i = 0; i < num; i++)  //for (i = 0; i < 10; i++)
    {
        printf("%d ", arr[i]);
    }
    return 0;
}

懂了懂了

ok感谢指点