Question

How to find the smallest missing number from sorted array in C++

Answer 1

#include <iostream>

int findSmallestMissingNumber(int arr[], int size) {
    int min = arr[0];
     
    for (int i = 1; i < size; i++) {
        if (arr[i] > min + 1) {
            return min + 1;
        } else {
            min = arr[i];
        }
    }
     
    return -1;
}
                     
int main(void) {
    int arr[] = {18, 19, 20, 27, 33, 36, 40, 42};
    int size = sizeof(arr) / sizeof(arr[0]);
 
    std::cout << findSmallestMissingNumber(arr, size);
}
 
 
 
 
/*
run:
 
21
 
*/

 

70+ SQL courses for beginners and professionals