我对通过引用传递数组感到困惑。由于数组存储在堆上,我相信当它们作为参数传递时,参数的值就是堆中的位置。这可能会混淆变量所代表的内容。
ref
如果数组存储在堆上,那么在将数组传递给方法时,关键字究竟是什么意思?我相信更改被调用方法中的数组会更改调用方法,因为它是按值传递的,并且该值包含对数组的引用。如果我跳过
Sort
而是DoSort
直接调用,那么unsortedArray
排序正确。在下面的程序中,为什么unsortedArray
在执行结束时从不排序?这与这是一个递归算法有关吗?
这是代码:
public class Program {
static void Main(string[] args) {
int[] unsortedArray = new[] { 9, 7, 5, 3, 1 };
Sort(unsortedArray);
}
public static void Sort(int[] sortArray) {
DoSort(ref sortArray);
}
public static void DoSort(ref int[] doSortArray) {
if (doSortArray.Length == 1) {
return;
}
int midpoint = doSortArray.Length / 2;
// divide the array into the left portion
int[] left = new int[midpoint];
for (int i = 0; i < midpoint; i++) {
left[i] = doSortArray[i];
}
// divide the array into the right portion
int[] right = new int[doSortArray.Length - midpoint];
int j = 0;
for (int i = midpoint; i < doSortArray.Length; i++) {
right[j] = doSortArray[i];
j++;
}
DoSort(ref left);
DoSort(ref right);
doSortArray = Merge(left, right);
}
/// <summary>
/// Merges the specified unmerged array.
/// </summary>
/// <param name="left">The left.</param>
/// <param name="right">The right.</param>
private static int[] Merge(int[] left, int[] right) {
int i = 0;
int[] result = new int[left.Length + right.Length];
int leftIndex = 0;
int rightIndex = 0;
while (leftIndex < left.Length || rightIndex < right.Length) {
if (leftIndex < left.Length && rightIndex < right.Length) {
if (left[leftIndex] <= right[rightIndex]) {
result[i] = left[leftIndex];
leftIndex++;
} else {
result[i] = right[rightIndex];
rightIndex++;
}
}
else if (leftIndex < left.Length) {
result[i] = left[leftIndex];
leftIndex++;
}
else if (rightIndex < right.Length) {
result[i] = right[rightIndex];
rightIndex++;
}
i++;
}
return result;
}
}