Solution Review: Rearrange Sorted Array in Max/Min Form

namespace chapter_2
{
    class Challenge10
    {
        // Rearrange Sorted Array in Max/Min Form
        static void maxMin(int []arr, int size)
        {
            //Create a result array to hold re-arranged version of given arr
            int[] result = new int[size];
            int pointerSmall = 0,     //PointerSmall => Start of arr
            pointerLarge = size - 1;   //PointerLarge => End of arr
            //Flag which will help in switching between two pointers
            bool switchPointer = true;
            for (int i = 0; i < size; i++)
            {
                if (switchPointer)
                    result[i] = arr[pointerLarge--]; // copy large values
                else
                    result[i] = arr[pointerSmall++]; // copy small values
                switchPointer = !switchPointer;   // switching between samll and large
            }
            for (int j = 0; j < size; j++)
            {
                arr[j] = result[j];    // copying to original array
            }
           // delete[] result;
        }
        static void Main(string[] args)
        {
            int size = 6;
            int []arr = { 1, 2, 3, 4, 5, 6 };
            Console.Write("Array before min/max: ");
            for (int i = 0; i < size; i++)
                Console.Write(arr[i] + " ");
            Console.WriteLine("");
            maxMin(arr, size);
            Console.Write("Array after min/max: ");
            for (int i = 0; i < size; i++)
                Console.Write(arr[i] + " ");
        }
    }
}