QuickSort and BubbleSort

See more:

C#

Of course Im working on some code. I was given this Quicksort to use in my code by my instructor. Unfortunately he isnt available so I thought I would ask you...
In this code, which method do I call to main to complete the quicksort?
I have an easier one and have been comparing to find out and I figured it out in my other code but I cant in this one. I think its qs(T[] values). I thought it would be sort() but I run into problems when I call that method.

public class QuickSort<T> where T : IComparable
    {
        T[] input;
        public T[] Output
        {
            get
            {
                return input;
            }
        }
        public void qs(T[] values)
        {
            input = new T[values.Length];
            for (int i = 0; i < values.Length; i++)
            {
                input[i] = values[i];
                Console.WriteLine(input[i]);
                Console.WriteLine();
            }
        }

        // Set up a call to the actual Quicksort method.
        public void Sort()
        {
            Sorting(0, input.Length - 1);
        }
        public int getPivotPoint(int begPoint, int endPoint)
        {
            int pivot = begPoint;
            int m = begPoint + 1;
            int n = endPoint;
            while ((m < endPoint) &&
                   (input[pivot].CompareTo(input[m]) >= 0))
            {
                m++;
            }
            while ((n > begPoint) &&
                   (input[pivot].CompareTo(input[n]) <= 0))
            {
                n--;
            }
            while (m < n)
            {
                T temp = input[m];
                input[m] = input[n];
                input[n] = temp;
                while ((m < endPoint) &&
                       (input[pivot].CompareTo(input[m]) >= 0))
                {
                    m++;
                }
                while ((n > begPoint) &&
                       (input[pivot].CompareTo(input[n]) <= 0))
                {
                    n--;
                }
            }
            if (pivot != n)
            {
                T temp2 = input[n];
                input[n] = input[pivot];
                input[pivot] = temp2;
            }
            return n;
        }
        public void Sorting(int beg, int end)
        {
            if (end == beg)
            {
                return;
            }
            else
            {
                int pivot = getPivotPoint(beg, end);
                if (pivot > beg)
                    Sorting(beg, pivot - 1);
                if (pivot < end)
                    Sorting(pivot + 1, end);
            }
        }
    }
}

Any help will be appreciated. Thanks