This experiment surged from this tweet by @sindresorhus:

What's the simplest algorithm for splitting a (unordered) set of integers into n-2 even sub-sets where the sum of the elements in each sub-set have the minimum difference? Even better if someone has an example in Swift or JS. All the algorithms I found care about order.

— Sindre Sorhus (@sindresorhus) November 2, 2021

Basically, we want to put images into columns in such a way that the height of the columns is as similar as possible. As some people in the thread mentioned, this can be referred to as Greedy Number Partitioning, and several approximations exist.

In particular, I took three answers

This are the instructions on how to do the assignment. It's pretty straightforward, but just in case anyone finds eny difficulties with it. I'd suggest first thing you do is READ THE ASSIGNMENT and come here only if you have trouble. If you do, that's find. Follow the guide or ask for help in Slack. Good luck with it!

Everybody should do this again regardless you had done it already. I pushed new changes to the repo you need to have.

1. Go to the repo page.
2. Hit 'Clone or download' (big green button).
3. Select 'Use SSH' and copy the link.