How to Split a List into Nearly Equal Parts?

Dividing a List into Equal Parts

When working with a list of elements, it may be necessary to split it into smaller, approximately equal parts. This can be especially useful for tasks such as data processing, parallel computing, or distributed algorithms. Here's an exploration of a method to effectively divide a list into n parts.

Solution:

To achieve an almost equal split of a list into n parts, the following steps can be taken:

1. Calculate the quotient, k, and remainder, m, by dividing the length of the list by n: k, m = divmod(len(a), n).
2. Utilize a list generator to yield the split parts: (a[i*k min(i, m):(i 1)*k min(i 1, m)] for i in range(n)).

This approach ensures that the parts are divided nearly evenly, with the first m parts containing one additional element than the remaining n-m parts.

Example:

To illustrate the effectiveness of this method, consider a list of 11 integers: range(11). Dividing this list into 3 parts using the split function yields the following result:

>>> list(split(range(11), 3))

[[0, 1, 2, 3], [4, 5, 6, 7], [8, 9, 10]]

As can be observed, the list is divided into three parts with approximately equal sizes, with the first part containing four elements and the other two parts containing three elements each.

The above is the detailed content of How to Split a List into Nearly Equal Parts?. For more information, please follow other related articles on the PHP Chinese website!