Binary Search using Recursion

 class Program
    {
        static void Main(string[] args)
        {
            int[] A = { 11, 22, 33, 44, 55, 66, 77, 88 };
            binary_search(A,0,7,77);
        }
        static void binary_search(int[] L, int l,int u, int item)
        {
            int m;
            while (l <= u)
            {

                m = (l + u) / 2;
                if(L[m] == item)
                {
                    Console.WriteLine("Search Successful");
                    return;
                }
                else if(item < L[m])
                {
                    binary_search(L, l, m - 1, item);
                }
                else
                {
                    binary_search(L, m+1, u, item);
                }

                return;

            }
            Console.WriteLine("Search Unsuccessfull");

        }
    }