数组冒泡,选择,插入排序

#include <stdio.h>
#include <stdlib.h>
/* { 4, 2, 6, 11, 8, 3, 5, 12, 9, 10 };*/
#define swap(x,y)   (x)=(x)^(y);\
    (y) = (x) ^ (y); \
    (x) = (x) ^ (y)

void maopaosort(int *a, int n);

void insertsort(int *a, int n, int inum)
{
    maopaosort(a, n);
    a = (int *)realloc(a, sizeof(int)*(n + 1));
    if (inum > a[n - 1])
    {
        a[n] = inum;
    }
    else if (inum < a[0])
    {
        for (int i = n + 1; i>0; i--)
        {
            a[i - 1] = a[i - 2];
        }
        a[0] = inum;
    }
    else
    {

        for (int i = 0; i < n - 1; i++)
        {
            if (inum > a[i] && inum < a[i + 1])
            {
                for (int j = n; j>i; j--)
                {
                    a[j] = a[j - 1];
                }
                a[i + 1] = inum;
            }
        }
    }
}


void Selectionsort(int *a, int n)
{
    for (int i = 0; i < n; i++)
    {
        for (int j = i + 1; j < n; j++)
        {
            if (a[i] > a[j])
            {
                swap(a[i], a[j]);
            }
        }
    }

}



void maopaosort(int *a, int n)
{
    for (int i = 0; i < n - 1; i++)
    {
        for (int j = 0; j < n - 1 - i; j++)
        {
            if (a[j] > a[j + 1])
            {
                swap(a[j], a[j + 1]);
            }
        }
    }
}

int main()
{
    int *a = (int *)malloc(sizeof(int)* 10);
    //int a[10] = { 4, 2, 6, 11, 8, 3, 5, 12, 9, 10 };
    a[0] = 4;
    a[1] = 2;
    a[2] = 22;
    a[3] = 11;
    a[4] = 8;
    a[5] = 3;
    a[6] = 5;
    a[7] = 12;
    a[8] = 9;
    a[9] = 10;

    //maopaosort(a, 10);
    //Selectionsort(a, 10);
    insertsort(a, 10, 7);
    for (int i = 0; i < 11; i++)
    {
        printf("%d,", a[i]);
    }
    getchar();
    return 1;
}