Trying to write a binary search without testing

BinarySearch in C#

        static int BinarySearch(int[] array, int target)
        {
            int high = array.Length - 1;
            int low = 0;
            int mid = (high + low) / 2;

            while (high >= low)
            {
                if (array[mid] == target)
                {
                    return mid;
                }
                else if (array[mid] > target)
                {
                    high = mid - 1;
                }
                else
                {
                    low = mid + 1;
                }

                mid = (high + low) / 2;
            }

            return -1;
        }

Read this blog post: http://reprog.wordpress.com/2010/04/19/are-you-one-of-the-10-percent/

After reading, I decided to give it a try, and here's the result. Seems to work correctly. Doesn't explicitly handle the 0-length array, but handled it correctly (luckily).

"mid" can be computed inside the loop; that way, you only need to do it once