Reverse an integer array - With a recursive approach

RecursiveReverse.cs

/*
Copyright 2018 Intel Corporation. 

The source code, information and material ("Material") contained herein 
is owned by Intel Corporation or its suppliers or licensors, and title 
to such Material remains with Intel Corporation or its suppliers or 
licensors. The Material contains proprietary information of Intel or its 
suppliers and licensors. The Material is protected by worldwide 
copyright laws and treaty provisions. No part of the Material may be 
used, copied, reproduced, modified, published, uploaded, posted, 
transmitted, distributed or disclosed in any way without Intel's prior 
express written permission. No license under any patent, copyright or 
other intellectual property rights in the Material is granted to or 
conferred upon you, either expressly, by implication, inducement, 
estoppel or otherwise. Any license under such intellectual property 
rights must be express and approved by Intel in writing. 

Unless otherwise agreed by Intel in writing, you may not remove or alter 
this notice or any other notice embedded in Materials by Intel or 
Intel's suppliers or licensors in any way. 
*/

using System;
using System.Linq;

namespace ArrayReverse
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] testArray = Enumerable.Range(1, 100000).ToArray();
            
            for (var k = 1; k < 100000; k++)
            {
                RecursiveReverse(ref testArray, 0, testArray.Length - 1);
            }

            Console.WriteLine("Array Reverse complete");
        }

        static void RecursiveReverse(ref int[] inputArray, int start, int end)
        {
            if (start >= end)
                return;

            var temp = inputArray[start];
            inputArray[start] = inputArray[end];
            inputArray[end] = temp;

            RecursiveReverse(ref inputArray, start + 1, end - 1);
        }
    }
}