Continuing to an outer loop. "How does the performance compare for traditional looping approaches and the concise LINQ implementation?
" For simple selecting based on a single criteria (meaning no nested loops), it certainly appears a loop holds its own versus LINQ, at least in my ridiculously uncomplicated tests involving building a list of ints and then selecting all ints less than some arbitrary value. For my purposes, I had a list of 80000 integers and then selected all integers less than the midpoint. On average, a loop did that in 2 milliseconds, LINQ did it in 5. Introduce a nested loop where I was going through that same list of 80000 integers and comparing it with another list of 66,667 integers (or whatever the number).
C# cancelling DoWork of background worker.