Убираем дубли из динамического массива с сохранением порядка

[teorema-kotelnikova]

#include
#include

void print(int *, int);
void withoutDoubles(int *, int&);

int main()
{
std::srand( time(NULL) );
int N, *arr;
std::cin>> N;
arr = new int[N];
for (int i=0; i < N; i++)
arr[i] = rand() % 10;
print(arr, N);
withoutDoubles(arr, N);
print(arr, N);
system("pause");
delete []arr;
return 0;
}

void print(int *arr, int N)
{
for (int i=0; i < N; i++)
std::cout<< arr[i]<< " ";
std::cout<< std::endl;
}

void withoutDoubles(int *arr, int &N)
{
int *arr2 = new int[N], counter = 0;
for (int i=0; i < N; i++)
{
bool b = false;
for (int j=0; j < counter; j++)
if (arr2[j] == arr[i])
{
b = true;
break;
}
if (!b)
arr2[counter++] = arr[i];
}
delete []arr;
arr = new int[counter];
for (int i=0; i < counter; i++)
arr[i] = arr2[i];
delete []arr2;
N = counter;
}