Question

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

Answer 1

using System;

class Program
{
    private static int findSmallestMissingNumber(int[] arr) {
		int min = arr[0];
		int size = arr.Length;

		for (int i = 1; i < size; i++) {
			if (arr[i] > min + 1) {
				return min + 1;
			}
			else {
				min = arr[i];
			}
		}

		return -1;
	}
    static void Main() {
        int[] arr = new int[] {18, 19, 20, 27, 33, 36, 40, 42};

		Console.Write(findSmallestMissingNumber(arr));
    }
}







/*
run:
   
21
   
*/

 

70+ SQL courses for beginners and professionals