去掉数组中重复的元素

/*方法一：先排序后去除重复元素*/
#include<stdio.h>
#define N 10
int main()
{
    int removeRepeat(int *,int);
    void sort(int *,int);
    int i,n,array[N];
    for(i=0;i<N;++i)
        scanf("%d",array+i);
    sort(array,N);
    n=removeRepeat(array,N);/*去除重复元素并返回不重复元素的个数*/
    for(i=0;i<n;++i)
        printf("%d ",array[i]);
    return 0;
}

void sort(int *a,int n)/*折半插入排序*/
{
    int i,j,temp,low,high,mid;
    for(i=1;i<n;++i)
    {
        temp=a[i];
        low=0;
        high=i-1;
        while(low<=high)
        {
            mid=(low+high)/2;
            if(temp>a[mid])
                low=mid+1;
            else
                high=mid-1;
        }
        for(j=i-1;j>high;--j)
            a[j+1]=a[j];
        a[low]=temp;
    }
}

int removeRepeat(int *a,int n)/*去除重复元素函数*/
{
    int i,j;
    for(i=0,j=0;i<n;++i)
        if(a[i+1]!=a[j])
            a[++j]=a[i+1];
    return j;
}
/*方法二：不排序，直接进行去重复操作*/
#include<stdio.h>
#define N 10

int main()
{
    int removeRepeat(int *a,int n);
    int i,n,num[N];
    printf("Enter %d numbers:\n",N);
    for(i=0;i<N;++i)
        scanf("%d",num+i);
    n=removeRepeat(num,N);
    printf("The result is :\n");
    for(i=0;i<n;++i)
        printf("%d ",num[i]);
    return 0;
}

int removeRepeat(int *a,int n)
{
    int i,j,k;
    for(i=0;i<n-1;++i)
        for(j=i+1;j<n;++j)
            if(a[i]==a[j])
            {
                for(k=j;k<n-1;++k)
                    a[k]=a[k+1];
                --n;
            }
    return n;
}