Wrote a code for merge sort in C#

[DhruvTotala]

The provided C# code implements the Merge Sort algorithm, which follows a divide-and-conquer approach. The Sort() function recursively splits the array into two halves until the base case of a single element is reached. The Merge() function then combines the two sorted halves by comparing elements from both subarrays and copying the smaller ones back into the original array. The process continues recursively until the entire array is sorted. The Main() function demonstrates the algorithm on a sample array, printing both the unsorted and sorted arrays. Merge Sort has a time complexity of O(n log n) and is stable.

[DhruvTotala]

@ritikbanger review this code