How Can I Split a Collection into Subsets of (Nearly) Equal Size Using LINQ?

Split a collection into subsets using LINQ

LINQ allows dividing a collection into a specified number of subsets. Unlike even splitting, the last subset may have a different number of elements than the other subsets.

To achieve this we can use a simple LINQ extension method:

<code class="language-csharp">static class LinqExtensions
{
    public static IEnumerable<IEnumerable<T>> Split<T>(this IEnumerable<T> list, int parts)
    {
        int i = 0;
        var splits = from item in list
                     group item by i++ % parts into part
                     select part.AsEnumerable();
        return splits;
    }
}</code>

Using this method, you can divide the collection into sub-collections while ensuring that the last subset may be of different sizes. The above code does this by grouping elements based on their index modulo the number of subsets, effectively assigning them to different subsets.

The above is the detailed content of How Can I Split a Collection into Subsets of (Nearly) Equal Size Using LINQ?. For more information, please follow other related articles on the PHP Chinese website!