蔡子经数据结构1.3

int (const void *a, const void *b)
{
    return *(int*)a - *(int*)b;
}

void print(int *a, int n)
{
    for(int i = 0; i < n; ++i)
        printf("%d ",a[i]);
    puts("");
}

int unique(int *a, int n)
{
    int ret = 1;
    for(int i = 1; i < n; ++i)
        if(a[i] != a[i-1])
            a[ret++] = a[i];
    return ret;
}

int main()
{
    int a[10] = {1,1,3,4,4,5,4,3,1,1};
    print(a, 10);
    qsort(a,10,sizeof(a[0]),comp);
    print(a, 10);
    int n = unique(a, 10);
    print(a, n);
    return 0;

}