using System;

​

public class Program

{

    public static void Main(string[] args)

    {

        int num = GetPositiveNumber();

        int[] arr = SortArray(GetPositiveArray(num));

        int search = GetPositiveNumber();

        if (BinSearch(arr, search) != -1)

            Console.WriteLine("The nuber appeared in the array in the {0} index", BinSearch(arr, search));

        else

        {

            if (search > arr[num - 1])

                Console.WriteLine("The number is bigger than all the numbers in the array");

            else

                Console.WriteLine("The number is smaller than all the numbers in the array");

        }

    }

​

    static int GetPositiveNumber()

    {

        while (true)

        {

            Console.WriteLine("Please enter a positive integer:");

            int num = int.Parse(Console.ReadLine());

            if (num > 0)

                return num;

        }

    }

​

    static int[] GetPositiveArray(int num)

    {

        int[] arr = new int[num];

        for (int i = 0; i < num; i++)

        {

            arr[i] = GetPositiveNumber();

        }

​

        return arr;

    }

​

    static int[] SortArray(int[] arr)

    {

        int iMin, temp;

        for (int i = 0; i < arr.Length - 1; i++)

        {

            iMin = i;

            for (int j = i + 1; j < arr.Length; j++)

                if (arr[j] < arr[iMin])

                    iMin = j;

            temp = arr[iMin];

            arr[iMin] = arr[i];

            arr[i] = temp;

        }

​

        return arr;

    }

​

    static int BinSearch(int[] arr, int num)

    {

        int left = 0;

        int right = arr.Length - 1;

        while (left <= right)

        {

            int mid = (left + right) / 2;

            if (arr[mid] == num)

                return mid;

            if (num < arr[mid])

                right = mid - 1;

            else

                left = mid + 1;

        }

​

        return -1;

    }

}