Quick Sort : Sort « Collections Data Structure « C# / C Sharp

1. C# / C Sharp
2. Collections Data Structure
3. Sort

Quick Sort

        

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.IO;
using System.Runtime.InteropServices;

public static class Helper
{
    public static void QuickSort<T>(ref T[] array, int left, int right) where T : IComparable<T>
    {
        int left_index = left;
        int right_index = right;
        T pivot = array[(left + right) / 2];

        while (left_index <= right_index)
        {
            while (array[left_index].CompareTo(pivot) < 0)
                left_index++;
            while (array[right_index].CompareTo(pivot) > 0)
                right_index--;

            if (left_index <= right_index)
                Swap<T>(ref array[left_index++], ref array[right_index--]);
        }

        if (right_index > left)
            QuickSort(ref array, left, right_index);

        if (left_index < right)
            QuickSort(ref array, left_index, right);
    }

    public static void Swap<T>(ref T a, ref T b)
    {
        T temp = a;
        a = b;
        b = temp;
    }

}

   
    
    
    
    
    
    
    
  

Related examples in the same category

1.	Implements the recursive merge sort algorithm to sort an array
2.	Sorts an array of data using the insertion sort algorithm
3.	Bubble sort
4.	A simple version of the Quicksort
5.	Demonstrate the Bubble sort
6.	Insert Sort
7.	A simple stable sorting routine - far from being efficient, only for small collections.