Well, maybe...

public class GenericComparer : IComparer {

public GenericComparer( CompareDelegate doCompare ){

if( doCompare == null ){

throw new ArgumentNullException("doCompare");

this.doCompare = doCompare;

public int Compare( object x, object y ){

if( x == null ){

if( y == null ){

return 0;

return -1;

if( y == null ){

return 1;

return doCompare(x,y);

private CompareDelegate doCompare;

public delegate int CompareDelegate( object x, object y );

Update:
My colleague Branimir did a little experimentation and found this implementation is similar in performance to a 'regular' methodcall when sorting around 10.000 items.