C# Sort and OrderBy comparison

by

No, they aren’t the same algorithm. For starters, the LINQ OrderBy is documented as stable (i.e. if two items have the same Name, they’ll appear in their original order).

It also depends on whether you buffer the query vs iterate it several times (LINQ-to-Objects, unless you buffer the result, will re-order per foreach).

For the OrderBy query, I would also be tempted to use:

OrderBy(n => n.Name, StringComparer.{yourchoice}IgnoreCase);

(for {yourchoice} one of CurrentCulture, Ordinal or InvariantCulture).

List<T>.Sort

This method uses Array.Sort, which
uses the QuickSort algorithm. This
implementation performs an unstable
sort; that is, if two elements are
equal, their order might not be
preserved. In contrast, a stable sort
preserves the order of elements that
are equal.

Enumerable.OrderBy

This method performs a stable sort; that is, if the keys of two elements are equal, the order of the elements is preserved. In contrast, an unstable sort does not preserve the order of elements that have the same key.
sort; that is, if two elements are
equal, their order might not be
preserved. In contrast, a stable sort
preserves the order of elements that
are equal.

More Related Contents:

  1. How to create a new object instance from a Type
  2. How do you sort a dictionary by value?
  3. In .NET, which loop runs faster, ‘for’ or ‘foreach’?
  4. Comparing two byte arrays in .NET
  5. Handling warning for possible multiple enumeration of IEnumerable
  6. Benchmarking small code samples in C#, can this implementation be improved?
  7. C# List Sort by x then y
  8. Performance Tests of Serializations used by WCF Bindings
  9. Exact time measurement for performance testing [duplicate]
  10. What is the real overhead of try/catch in C#?
  11. Performance of calling delegates vs methods
  12. When is optimization premature? [closed]
  13. Float vs Double Performance
  14. Sorting an array of folder names like Windows Explorer (Numerically and Alphabetically) – VB.NET
  15. How do I do logging in C# without using 3rd party libraries? [closed]
  16. C# / F# Performance comparison
  17. Performance of “direct” virtual call vs. interface call in C#
  18. System.Net.WebClient unreasonably slow
  19. Performance of Find() vs. FirstOrDefault() [duplicate]
  20. Does String.GetHashCode consider the full string or only part of it?
  21. How would I sort a list of files by name to match how Windows Explorer displays them?
  22. How do I measure how long a function is running?
  23. LINQ performance FAQ
  24. Is it better to execute many sql commands with one connection, or reconnect every time?
  25. Is there a sorted collection type in .NET?
  26. BindingList.Sort() to behave like a List.Sort()
  27. How to read last “n” lines of log file [duplicate]
  28. Why is my C# program faster in a profiler?
  29. Array bounds check efficiency in .net 4 and above
  30. Fastest implementation of log2(int) and log2(float)

Leave a Comment