Binary Search algorithm

using System;

namespace Task_11_BinarySearch
{
class Program
{
static void Main()
{
    int[] Arr = new int[10];
    int WantedNumber;
    int Start = 0;
    int End = Arr.Length - 1;
    int Mid = 0;
    bool KeyFound = false;

    for (int i = 0; i < Arr.Length; i++)
    {
        Console.Write("Element {0}: ", i);
        Arr[i] = int.Parse(Console.ReadLine());
    }

    Console.Write("Please enter the digit you are looking for: ");
    WantedNumber = int.Parse(Console.ReadLine());

    //Sort the array ascending and print it
    Array.Sort(Arr);

    Console.Write("This is the sorted array: {");
    for (int i = 0; i < Arr.Length; i++)
    {
        Console.Write(Arr[i] + " ");
    }
    Console.WriteLine("}");

    //Look for the wanted number
    while (KeyFound == false)
    {
        Mid = Start + (End - Start) / 2;

        if (WantedNumber > Arr[Mid])
        {
            Start = Mid;
            End = Mid + (Arr.Length - Mid) / 2;
        }
        if (WantedNumber < Arr[Mid])
        {
            Start = Mid / 2;
            End = Mid;
        }
        if (WantedNumber == Arr[Mid])
        {
            Console.WriteLine("The index of the wanted number is: {0}! Wanted number: {1}", Mid, Arr[Mid]);
            KeyFound = true;
        }
        if (WantedNumber == Arr[Mid + 1])
        {
            Console.WriteLine("The index of the wanted number is: {0}! Wanted number: {1}", Mid+1, Arr[Mid + 1]);
            KeyFound = true;
        }
        if (WantedNumber == Arr[Mid - 1])
        {
            Console.WriteLine("The index of the wanted number is: {0}! Wanted number: {1}", Mid-1, Arr[Mid - 1]);
            KeyFound = true;
        }
    }
}
}
}