Sorting in Generic List

Question

0.00/5 (No votes)

See more:

.NET3.5

Hi,

There are the following methods to sort a collection of List<t>
1-Using delegate
2-Using lambda expressions
3-Using IComparer
4-Implementing IComparable in the T class

Is there any benefits as to which of the above 4 techniques should be used, is there any performance associated.
I know it is better maintainable and read if we implement IComparable in our class and if he have multiple sorting criteria we can have IComparer.

Thanks everyone for your views.

Regards,
Sakshi

Posted 19-Feb-13 0:39am

Sakshi Smriti

Add a Solution

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

**Joezer BH** · Answer 1 · 2013-02-19T02:16:00

Firstly,

1 and 2 are not comparable to 3 and 4
and besides - the performance of such functions will be determined mostly by the sorting algorithm itself, regardless of the implementation, this is one of the basic concepts of Computer Science

regarding delegate and lambda expressions, give us your usage and then we can relate to analyzing the performance of that example.
3. and 4. - and as a thumb rule: A well written code will (most of the times) top the performance of a off-the-shelf implementation.
However, then you have maintenance and upgrading to think of...

Good Luck,
Edo

Sakshi Smriti · Answer 2 · 2013-02-19T17:14:00

I believe the sorting is implemented in the Sort internally by Miscrosoft.

We just provide the comparison rule
Consider the case

C#

public class Employee
{
  public string Name{get;set;}
  public string Age{get;set;}
}
//Consider the list
//Say we populated the list with Employees
List<employee> employees = new List<employee>();
//1-Using Delegate
employees.Sort(delegate(Employee e1, Employee e2) { return e1.age.CompareTo(e2.age); });
//2-Using Lambda
employees.Sort((e1, e2) => e1.age.CompareTo(e2.age));
//3-Implement Icomparable in Employee class and write the same logic in Employee class //method CompareTo. Then we can call employees.Sort()
//4-Same for Icomparer as in comment 3
</employee></employee>

So I believe the sorting algo is written deep down in the .NET internals(as far as I know it implements a stable QuickSort algo), what we are providing is the sorting criteria.

My question is can we use any of the above 4 or is there a good, better and best in them

So when you are saying about the sorting algoritm there I can see I have little scope to do anything.
Thanks Edo for your reply and time.

Regards,
Sakshi

Sorting in Generic List

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0