Simple Sorting Algorithms in C#

using System;

public class Solution
{
    public static void QuickSort(int[] arr, int low, int high)
    {
        if (low < high)
        {
            int pi = Partition(arr, low, high);

            // Recursively sort elements before partition and after partition
            QuickSort(arr, low, pi - 1);
            QuickSort(arr, pi + 1, high);
        }
    }

    private static int Partition(int[] arr, int low, int high)
    {
        int pivot = arr[high];
        int i = (low - 1); // Index of smaller element
        for (int j = low; j < high; j++)
        {
            // If current element is smaller than or equal to pivot
            if (arr[j] <= pivot)
            {
                i++;

                // Swap arr[i] and arr[j]
                int temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }

        // Swap arr[i+1] and arr[high] (or pivot)
        int temp1 = arr[i + 1];
        arr[i + 1] = arr[high];
        arr[high] = temp1;

        return i + 1;
    }

    public static void Main(string[] args)
    {
        int[] arr = {10, 7, 8, 9, 1, 5};
        int n = arr.Length;

        QuickSort(arr, 0, n - 1);

        Console.WriteLine("Sorted array: ");
        for (int i = 0; i < n; i++)
            Console.Write(arr[i] + " ");
        // Output: 1 5 7 8 9 10
    }
}