[C#]二叉查找法

public int binSearch(int value)
         { int upperBround, lowerBound, mid;
             upperBround = arr.Length - 1;
             lowerBound = 0; while (lowerBound <= upperBround)
             {

                 mid = (upperBround + lowerBound) / 2; if (arr[mid] == value)   
                 { return mid;
                 } else if (value < arr[mid]) 
                 {
                     upperBround = mid - 1;
                 } else {
                     lowerBound = mid + 1;
                 }


             } if (lowerBound > upperBround) return -1; return (upperBround + lowerBound) / 2;
         }

*/
            CArray nums = new CArray(10);
            Random rnd = new Random(); for (int i = 0; i < 10; i++)
            {
                nums.Insert(rnd.Next(100));
            }
            nums.BubbleSort();
            nums.DisplayElements(); int position = nums.binSearch(77); if (position > -1)
            {
                Console.WriteLine("Find item 77");
                nums.DisplayElements();
            } else {
                Console.WriteLine("Not in the array");

            }
            Console.ReadKey();