Click here to Skip to main content
13,354,733 members (60,499 online)
Click here to Skip to main content
Add your own
alternative version


14 bookmarked
Posted 22 Dec 2004

Generic Quick Sort using anonymous methods

, 22 Dec 2004
Rate this:
Please Sign up or sign in to vote.
Shows how to implement generic methods and how to use anonymous methods in C# 2.0.

Sample Image


The code simply implements static generic methods. It does not really solve any problems as there is a sort method in the framework that is probably better than this one. Its purpose is to show the quicksort algorithm and how to use generics and anonymous methods.

Using the code

To use this code, just pass any array and delegate method that can compare items in the array against each other. Notice that I use the keyword delegate as I define an anonymous method. The parameters and return type of this anonymous method (if any) must match the signature of the delegate type expected, in this case Compare.

using System;
using System.Text;

public class Test
    public delegate bool Compare<T>(T rhs, T lhs);
    public static void Main()
        Random r = new Random();
        int[] stuff = new int[10];
        for (int i = 0; i < stuff.Length; i++)
            stuff[i] = r.Next(10);
        QuickSort(ref stuff, delegate(int rhs, int lhs){return rhs <= lhs; });
        Console.WriteLine(PrintArray(stuff, 0, stuff.Length));
    public static void QuickSort<T>(ref T[] values, Compare<T> comp)
        QuickSortRecurse(ref values, 0, values.Length, comp);
    public static void Swap<T>(ref T a, ref T b)
        T temp = a;
        a = b;
        b = temp;
    public static string PrintArray<T>(T[] values, int start, int end)
        StringBuilder builder = new StringBuilder();
        for (int i = start; i < end; i++)
            builder.Append(" ");
        return builder.ToString();
    public static void QuickSortRecurse<T>(ref T[] values, 
           int start, int end, Compare<T> comp)
        if ((end - start) < 2) return;
        if (((end - start) == 2)) 
            if (!comp(values[start], values[end - 1]))
                Swap(ref values[start], ref values[end-1]);
        int stop = end - 1;
        int i = start + 1;
        while (i < stop)
            while (!comp(values[start], values[i]) && i < stop) i++;
            while (comp(values[start], values[stop]) && stop >= i) stop--;
            if (i < stop)
                Swap(ref values[i], ref values[stop]);
        if (start < stop)
            Swap(ref values[start], ref values[stop]);
        if (start < stop-1)
            QuickSortRecurse(ref values, start, stop, comp);
        if (stop+1 < end)
            QuickSortRecurse(ref values, stop + 1, end, comp);

Points of Interest

Generics, as shown in this example, will dynamically derive the type of T when not explicitly stated.


This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here


About the Author

Doug Coburn
United States United States
No Biography provided

You may also be interested in...


Comments and Discussions

GeneralKernighan and Plaugher's bug lives on Pin
mdgray27-Dec-04 10:21
membermdgray27-Dec-04 10:21 
GeneralRe: Kernighan and Plaugher's bug lives on Pin
Anonymous27-Jun-05 12:25
sussAnonymous27-Jun-05 12:25 
GeneralRe: Kernighan and Plaugher's bug lives on Pin
Boudino20-Oct-05 2:35
memberBoudino20-Oct-05 2:35 
GeneralRe: Kernighan and Plaugher's bug lives on Pin
mdgray20-Oct-05 15:36
membermdgray20-Oct-05 15:36 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.

Permalink | Advertise | Privacy | Terms of Use | Mobile
Web02 | 2.8.180111.1 | Last Updated 23 Dec 2004
Article Copyright 2004 by Doug Coburn
Everything else Copyright © CodeProject, 1999-2018
Layout: fixed | fluid