Build a hash table of all the values. For the numbers 1 to n + 1, check if they are in the hash table. At least one of them is not. Print out the lowest such number.
This is O(n) expected time (you can get with high probability). See @Gassa's answer for how to avoid the hash table in favor of a lookup table of size O(n).
