Binary and Linear searchs

See more:

C#

I am putting together code but I am doing something wrong. I need to open a file of arrays, ask the user to input what number they want to search for, then complete a linear search, reload file, and sort to do a binary search.
My problem is when I enter numbers not included in the search its saying that the number is found(which is wrong). Any suggestions on what I might be doing wrong. The code Im having trouble with is listed below. This is part of the main code

int a = -1;
bs.Binary(unsorted, searchvalue);
if (a == -1)
    Console.Out.WriteLine("Element " + searchvalue + " was not found!");
else
    Console.Out.WriteLine("Element " + searchvalue + " was found.");

This is the implementation file

    class LinearSearch<T>
    {
        public bool Linear(int[] A, int sv)
        {
            int count = 0;
            for (int i = 0; i < A.Length - 1; i++)
            {
                count++;
                if (sv == A[i])
                    return true;
            }
            return false;
        }   //Linear()
    }

    class BinarySearch<T>
    {
        public int Binary(int[] A, int sv)
        {
            int size = 100;
            int left = 0;
            int right = size - 1;
            while (left <= right)
            {
                int midpoint = (left + right) / 2;
                // check to see if value is equal to item in array
                if (sv == A[midpoint])
                {
                    return sv;
                }
                else if (A[midpoint] > sv)
                {
                    right = midpoint - 1;
                }
                else
                    left = midpoint + 1;
            }
            // item was not found
            return -1;
        }// Binary
    }
}

[Removed duplicate code snippet - Henry]