Is a LINQ statement faster than a 'foreach' loop?

c# performance linq foreach
Neil Knight picture Neil Knight · Jul 1, 2010 · Viewed 123.2k times · Source

I am writing a Mesh Rendering manager and thought it would be a good idea to group all of the meshes which use the same shader and then render these while I'm in that shader pass.

I am currently using a foreach loop, but wondered if utilising LINQ might give me a performance increase?

Answer

codymanix picture codymanix · Jul 1, 2010

Why should LINQ be faster? It also uses loops internally.

Most of the times, LINQ will be a bit slower because it introduces overhead. Do not use LINQ if you care much about performance. Use LINQ because you want shorter better readable and maintainable code.

Related questions

LINQ: Not Any vs All Don't

Often I want to check if a provided value matches one in a list (e.g. when validating): if (!acceptedValues.Any(v => v == someValue)) { // exception logic } Recently, I've noticed ReSharper asking me to simplify these queries to: if (acceptedValues.…

Read More
Performance of Find() vs. FirstOrDefault()

Similar Question: Find() vs. Where().FirstOrDefault() Got an interesting outcome searching for Diana within a large sequence of a simple reference type having a single string property. using System; using System.Collections.Generic; using System.Linq; public class Customer{ public …

Read More
LINQ Ring: Any() vs Contains() for Huge Collections

Given a huge collection of objects, is there a performance difference between the the following? Collection.Contains: myCollection.Contains(myElement) Enumerable.Any: myCollection.Any(currentElement => currentElement == myElement)

Read More