binary search, no recursion

using System;
class BinarySearch
{
    static void Main()
    {
        Console.Write("Enter the array length: ");
        int length = int.Parse(Console.ReadLine());
        Console.Write("Enter the element to be found: ");
        int element = int.Parse(Console.ReadLine());
        int[] myArray = new int[length];
        for (int i = 0; i < length; i++)
        {
            Console.Write("Enter the Array1 Element[{0}]: ", i + 1);
            myArray[i] = int.Parse(Console.ReadLine());
        }
        int minValue = 0;
        int maxValue = myArray.Length;
        Array.Sort(myArray);
        bool isAvailable = false;

        while (minValue <= maxValue)
        {
            int midElement = minValue / 2 + maxValue / 2;
            if (myArray[midElement] < element)
            {
                minValue = midElement + 1;
                continue;
            }
            else if (myArray[midElement] > element)
            {
                maxValue = midElement - 1;
                continue;
            }
            else if (myArray[midElement] == element)
            {
                Console.WriteLine("The element {0} is in position {1}", myArray[midElement], midElement);
                isAvailable = true;
                break;
            }
        }
        if (!isAvailable) Console.WriteLine("There is no element with value {0}", element);
    }
}