Re: complex List<> sorting

[Marc Gravell]

I would like to know how to write this in LINQ

You don't need LINQ for this; you can sort the existing list using a
Comparer<T>:

List<InterfaceBaselist = new List<InterfaceBase>();

list.Sort((x, y) =>
{
int result = x.Ordering.CompareTo(y.Ordering);
if (result == 0) result = string.Compare(x.Title, y.Title);
return result;
});

or in C# 2 (VS2005):

list.Sort(delegate (InterfaceBase x, InterfaceBase y)
{
int result = x.Ordering.CompareTo(y.Ordering);
if (result == 0) result = string.Compare(x.Title, y.Title);
return result;
});

If you really want to use LINQ, you can - but note that you get a new
list - you don't sort the existing one:

List<InterfaceBasenewList = (
from item in list
orderby item.Ordering, item.Title
select item).ToList();

Marc