linq orderby.tolist() performance

c# performance sql-order-by linq-to-objects tolist
Baran picture Baran · Feb 14, 2011 · Viewed 13.5k times · Source

I have an ordering query to a List and calling for many times. list = list.OrderBy().ToList(); In this code ToList() method is spending high resources and takes very long time. How can I speed up with another ordering method without converting back to a list. Should I use .Sort extension for arrays?

Answer

CaptainPlanet picture CaptainPlanet · Feb 14, 2011

First of all, try to sort the list once, and keep it sorted.

To speed up things you can use Parallel LINQ.

see: http://msdn.microsoft.com/en-us/magazine/cc163329.aspx

An OrderBy() Parallel looks like this:

 var query = data.AsParallel().Where(x => p(x)).Orderby(x => k(x)).ToList();

Related questions

C# Sort and OrderBy comparison

I can sort a list using Sort or OrderBy. Which one is faster? Are both working on same algorithm? List<Person> persons = new List<Person>(); persons.Add(new Person("P005", "Janson")); persons.Add(new Person("P002", "…

Read More
Best way to reverse a string

I've just had to write a string reverse function in C# 2.0 (i.e. LINQ not available) and came up with this: public string Reverse(string text) { char[] cArray = text.ToCharArray(); string reverse = String.Empty; for (int i = cArray.Length - 1; …

Read More
How to create a new object instance from a Type

One may not always know the Type of an object at compile-time, but may need to create an instance of the Type. How do you get a new object instance from a Type?

Read More