Binary Search in C#

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

            u = n - 1;
            while (l <= u)
            {

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

            }
            Console.WriteLine("Search Unsuccessfull");
        }
    }