Find the kth-largest array element

using System;

class Program
{
    static int Partition(int[] numbers, int low, int high)
    {
        int pivot = numbers[high], write = low;
        for (int i = low; i < high; i++)
        {
            if (numbers[i] > pivot) continue;
            int temporary = numbers[i]; numbers[i] = numbers[write]; numbers[write++] = temporary;
        }
        int saved = numbers[write]; numbers[write] = numbers[high]; numbers[high] = saved;
        return write;
    }

    static int KthLargest(int[] numbers, int k)
    {
        if (k < 1 || k > numbers.Length) throw new ArgumentOutOfRangeException("k");
        int target = numbers.Length - k, low = 0, high = numbers.Length - 1;
        while (true)
        {
            int pivot = Partition(numbers, low, high);
            if (pivot == target) return numbers[pivot];
            if (pivot < target) low = pivot + 1;
            else high = pivot - 1;
        }
    }

    static void Main()
    {
        Console.WriteLine(KthLargest(new[] { 3, 2, 1, 5, 6, 4 }, 2));
    }
}