我从这本书中找到了快速排序算法
这就是算法
QUICKSORT (A, p, r)
if p < r
q = PARTITION(A, p, r)
QUICKSORT(A, p, q-1)
QUICKSORT(A, q+1, r)
PARTITION(A, p, r)
x=A[r]
i=p-1
for j = p to r - 1
if A <= x
i = i + 1
exchange A[i] with A[j]
exchange A[i+1] with A[r]
return i + 1
我编写了以下这段 C# 代码:
private void quicksort(int[] input, int low, int high)
{
int pivot_loc = 0;
if (low < high)
pivot_loc = partition(input, low, high);
quicksort(input, low, pivot_loc - 1);
quicksort(input, pivot_loc + 1, high);
}
private int partition(int[] input, int low, int high)
{
int pivot = input[high];
int i = low - 1;
for (int j = low; j < high-1; j++)
{
if (input[j] <= pivot)
{
i++;
swap(input, i, j);
}
}
swap(input, i + 1, high);
return i + 1;
}
private void swap(int[] ar, int a, int b)
{
temp = ar[a];
ar[a] = ar[b];
ar[b] = temp;
}
private void print(int[] output, TextBox tbOutput)
{
tbOutput.Clear();
for (int a = 0; a < output.Length; a++)
{
tbOutput.Text += output[a] + " ";
}
}
当我调用这样的函数 quicksort(arr,0,arr.Length-1);
时,会出现以下错误 An unhandled exception of type 'System.StackOverflowException' occurred
,这是因为传递了空数组... 当我调用这样的函数 quicksort(arr,0,arr.Length);
时,会出现错误 Index was outside the bounds of the array.
,该错误发生在此行 int pivot = input[high];
,但是数组已经成功传递。我还想像这样打印它
print(input,tbQuick);
,但在哪里放置它才能在快速排序完成后打印呢?
quicksort
的位。为什么不在调用quicksort
之后直接打印作为下一个语句呢? - Deestan