冒泡排序C

#iinclude<stdio.h>

void paixu(int p[],int n)

{

   for (int i=0; i<n-1;i++)

    {

       int temp;

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

           {

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

                {

                    temp=p[j];

                    p[j]=p[j+1];

                    p[j+1]=temp;

       

                    }

                }

           }

 

}

 

int main(int argc, const char * argv[])

{

 

   

       int num2[6]={20,3,4,5,1,INT32_MAX};

       paixu(num2,6);

       int position=0;

       int insert;

       printf("请输入要插入的值");

       scanf("%d",&insert);//要输入插入的值

       for (int i=0; i<5; i++) {

           if (insert

                position=i;//知道到要插的位置

                for (i=5; i>position; i--){//移动位置，

                    num2[i]=num2[i-1];//实现效果

                }

                num2[position]=insert;//插入的值付给要插入位置的数组

                break;

           }

       }

       for (int i=0; i<6; i++) {

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

       }

        

    return 0;

}