Sorting algorithms/Quicksort: Difference between revisions

private T[] Samples { get; }

private Int32 Left { get; set; }

private Int32 Right { get; set; }

private Int32 LeftMedian { get; set; }

private Int32 RightMedian { get; set; }

#endregion

//

// The Tripartite conditional enables Bentley-McIlroy 3-way Partitioning.

// This performs additional compares to isolate islands of keys equal to

// the pivot value. Use unless key-equivalent classes are of small size.

//

#define Tripartite

namespace RosettaCode {

using System;

using System.Diagnostics;

public class QuickSort<T> where T : IComparable {

#region Constants

public const UInt32 INSERTION_LIMIT_DEFAULT = 12;

private const Int32 SAMPLES_MAX = 19;

#endregion

#region Properties

public UInt32 InsertionLimit { get; }

public QuickSort(UInt32 insertionLimit = INSERTION_LIMIT_DEFAULT) {