Problem Solving with c++ , solve 3 problems with 100%
Budget: $10 – $30 USD
- Must be experienced with c++ and can solve problem fast and efficiently. please if you have no efficient experience don't apply.
interested ? solve this problem and post the code in the solution in the proposal
//Write a function:
// that takes a vector A
//that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A.
//For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5.
//Given A = [1, 2, 3], the function should return 4.
//Given A = [−1, −3], the function should return 1.
//Write an efficient algorithm for the following assumptions:
//N is an integer within the range [1..100,000];
//each element of array A is an integer within the range [−1,000,000..1,000,000].
interested ? solve this problem and post the code in the solution in the proposal
//Write a function:
// that takes a vector A
//that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A.
//For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5.
//Given A = [1, 2, 3], the function should return 4.
//Given A = [−1, −3], the function should return 1.
//Write an efficient algorithm for the following assumptions:
//N is an integer within the range [1..100,000];
//each element of array A is an integer within the range [−1,000,000..1,000,000].