用c++编写查重函数

#include <iostream>
#include <assert.h>
using namespace std;

//Void Print(int br[10])
void Print_Ar(int* br, int n)
{
	for (int i = 0; i < n; ++i)
	{
		printf("%d", br[i]);
	}
	printf("\n");
}
//1..100
void Init_Ar(int* br, int n)
{
	assert(br != NULL);
	int* table = new int[n + 1];
	for (int i = 0; i <= n; ++i) { table[i] = 0; }
	int i = 0;
	while (i < n)
	{
		int tmp = rand() % 100 + 1;
		if (table[tmp] == 0)
		{
			table[tmp] = 1;
			br[i] = tmp;
			++i;
		}
	}
	delete[]table;
}
void bubbleSort(int *br, int n)
{
	assert(br != NULL);
	for (int i = 1,j; i < n; ++i)
	{
		for (j = 0; j < n-i; ++j)
		{
			if (br[j] > br[j + 1])
			{
				int tmp = br[j];
				br[j] = br[j + 1];
				br[j + 1] = tmp;
			}
		}
	}
}
void Swap_Int(int x, int y)
{

}



int FindValue(int *br, int n, int val)//index:-1
{
	assert(br != NULL);
	for (int i = 0; i < n; ++i)
	{
		if (br[i] == val)
		{
			return i;
		}
		else
		{
			return -1;
		}
	}
}

int main()
{
	int* p = NULL;
	int n = 0;

	scanf_s("%d", &n);//scanf("%d",&n);cin>>n;
	p = new int[n];
	//p=(int*)malloc(sizeof(int)*n);
	for (int i = 0; i < n; ++i)
	{
		p[i] = i;
	}
	for (int i = 0; i < n; ++i) { printf("%d", p[i]);}
	delete p;//C++
	//free(p);//C
	return 0;
}