Question

So, I’m doing an assignment for my C# class and I have a list of objects. These objects have an ‘int rand’ field which is assigned a random number. I then wanted to re-sort the objects in the list based on this rand field.

I found this article:
http://www.developerfusion.com/code/5513/sorting-and-searching-using-c-lists/

And it helped. I modified this line to fit my code:

people.Sort(delegate(Person p1, Person p2) { return p1.age.CompareTo(p2.age); });

And it does what I want.

What I want to know is: how does it work? That looks very confusing to me.

Answer 1

In fact Sort Method should sort base on some comparison, in your current code you passed comparison as delegate, you can also embed it in class definition to reduce code complexity, In fact it just needed to implement IComparable for your Person class:

 public class Person : IComparable
    {
        public int age { get; set; }

        public int CompareTo(object obj)
        {
            var person = obj as Person;
            if (person != null)
            {
                if (age > person.age)
                    return 1;
                else if (age == person.age)
                    return 0;
                return -1;
            }
            return 1;
        }
    }

then simply use sort without delegates.