请问大佬，这个冒泡排序可以改成其他的排序方法吗？

#include<stdio.h>
#include<stdlib.h>

int main()
{
    int *p,n,i,j,end,num,temp1,temp2;
    printf("请输入序列表长度:");
    scanf("%d",&n);
    p = (int *) malloc((n+1)*sizeof(int)) ;
    printf("请输入递增有序序数列:");
    for(i=0;i<n;i++)
    {
        scanf("%d",p+i);
    }
    while(1)
    {
        printf("请输入要插入的数据:");
        scanf("%d",&num);
        n++;
        p = (int *) realloc(p,(n+1)*sizeof(int)) ;
        if(num>=p[n-2])
        {
            p[n-1] = num;
        }
        else
        {
            for(i=n-2;i>=0;i--)
            {
                if(num>p[i])
                {
                    p[i+1] = num;
                    break;
                }
                else
                {
                    p[i+1]=p[i];
                }
            }
        }
        for(i=0;i<n;i++)
        {
            printf("%d,",p[i]);
        }
    }
    return 0;
}