how to use Sort() with two levels (without using Linq)?

Question

Hi
This code sorts by age. But is it possible to sort by age and then by name (without using Linq!).
I know how to do using Linq (var sort1 = le.OrderBy(x => x.Age).ThenBy(x => x.Name);), but i wonder whether it's possible to do the same with Sort().

Now i get this:
Joe USA 32
Bill USA 32
Bob UK 36

What i want is:
Bill USA 32
Joe USA 32
Bob UK 36

Thanks
V

using System;
using System.Collections.Generic;

class MyClass
{
public string Name;
public int Age;
public string Country;
}

class Program
{
static void Main(string[] args)
{
List<MyClass> t = new List<MyClass>();
t.Add(new MyClass() { Name = "Bob", Age = 36, Country = "UK" });
t.Add(new MyClass() { Name = "Joe", Age = 32, Country = "USA" });
t.Add(new MyClass() { Name = "Bill", Age = 32, Country = "USA" });
t.Sort((x, y) => x.Age.CompareTo(y.Age));
foreach (MyClass x in t)
Console.WriteLine(x.Name + " " + x.Country + ", " + x.Age);
}
}

Vishal Joshi · Answer

Yes, you can do it by specifying the comparison method. The advantage is the sorted object don't have to be IComparable t.Sort((x, y) => { int result = x.Age.CompareTo(y.Age); return result != 0 ? result : x.Name.CompareTo(y.Name); });

Sachin Singh · Answer

Yes, The Sort() method internally depends on IComparable implementation so you need to implement IComparable interface. class MyClass { public string Name; public int Age; public string Country; public int CompareTo(Object obj) { MyClass objMC=obj as MyClass; if(this.Age== objMC .Age) { retun this.Name.ComapreTo( objMC .Name); } return this.Age.CompareTo( objMC .Age); } } Now simply use Sort() over the list of MyClass object list.Sort();

Valerie Meunier · Answer

Thanks

Rahul Bansal · Answer

Try some thing like-- Sort a List by a Field in C# | Delft Stack https://www.delftstack.com/howto/csharp/sort-list-by-field-in-csharp/#:~:text=Use%20the%20OrderBy%20%28%29%20Method%20to%20Sort%20a,be%20checked%20to%20sort%20it%20in%20ascending%20order.