c# 快速排序法代码

以下是 C# 快速排序法的代码示例：

using System;

class QuickSort {
    static void Main(string[] args) {
        int[] arr = { 3, 7, 1, 5, 2, 9, 8, 4, 6 };
        Console.WriteLine("Original array: ");
        PrintArray(arr);
        QuickSortArray(arr, 0, arr.Length - 1);
        Console.WriteLine("\nSorted array: ");
        PrintArray(arr);
    }

    static void QuickSortArray(int[] arr, int left, int right) {
        if (left < right) {
            int pivot = Partition(arr, left, right);
            QuickSortArray(arr, left, pivot - 1);
            QuickSortArray(arr, pivot + 1, right);
        }
    }

    static int Partition(int[] arr, int left, int right) {
        int pivot = arr[right];
        int i = left;

        for (int j = left; j < right; j++) {
            if (arr[j] <= pivot) {
                Swap(arr, i, j);
                i++;
            }
        }

        Swap(arr, i, right);
        return i;
    }

    static void Swap(int[] arr, int i, int j) {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }

    static void PrintArray(int[] arr) {
        for (int i = 0; i < arr.Length; i++) {
            Console.Write(arr[i] + " ");
        }
    }
}

输出结果为：

Original array: 
3 7 1 5 2 9 8 4 6 

Sorted array: 
1 2 3 4 5 6 7 8 9
``