Facut si testat :) sper sa ajute. E recursiv ca a fost mai usor.
#include "stdafx.h"
#include <iostream>
using namespace std;
int n, x;
int *a;
void Minim()
{
for (int i = 0; i < n; i++)
{ if (x == a[i])
{ x++; Minim(); }
}
}
int main()
{ cout << "Introduceti n: ";
cin >> n;
a = new int[n]; x = 1;
for (int i = 0; i < n; i++)
{ cout << "A[" << i << "]: ";
cin >> a[i]; } Minim();
cout << "Minimul ne-existent in vector este: " << x << endl;
return 0;
}
