How to Efficiently Merge Two Sorted Arrays in C# Without Using Additional Memory?
I've been working on this all day and I'm updating my dependencies and I'm dealing with This might be a silly question, but Quick question that's been bugging me - I'm working on a C# application where I need to merge two sorted arrays into a single sorted array without using additional memory for another array. I understand that this can be done using a two-pointer technique, but I'm running into issues with the logic. Here's what I have so far: ```csharp public int[] MergeSortedArrays(int[] arr1, int[] arr2) { int i = 0, j = 0, index = 0; int[] mergedArray = new int[arr1.Length + arr2.Length]; // This is where I'm getting confused while (i < arr1.Length && j < arr2.Length) { if (arr1[i] <= arr2[j]) { mergedArray[index++] = arr1[i++]; } else { mergedArray[index++] = arr2[j++]; } } while (i < arr1.Length) { mergedArray[index++] = arr1[i++]; } while (j < arr2.Length) { mergedArray[index++] = arr2[j++]; } return mergedArray; } ``` The question is that I need to avoid using `mergedArray` entirely. I want to perform the merge in-place on one of the arrays. If I use the first array, how can I do this without exceeding its bounds? I get an `IndexOutOfRangeException` when I try to copy elements over, especially when the first array is smaller than the second. I've also considered shifting elements, but that seems inefficient. Could you provide a better approach or clarify how to resolve the bounds scenario without creating new arrays? I'm currently using .NET 6. Has anyone else encountered this? This is part of a larger web app I'm building. I'm using C# 3.10 in this project. I've been using C# for about a year now. My development environment is Ubuntu 22.04. What are your experiences with this? I've been using C# for about a year now. Thanks for taking the time to read this!