Similarly, if there is a mix of images of varying heights, then the alignment of the images in the last row is staggered, when it ought to vary as little as possible.
The partition problem
One means of getting around this is by using the greedy algorithm to the partition problem.
In number theory and computer science, the partition problem, or number partitioning, is the task of deciding whether a given multiset S of positive integers can be partitioned into two subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the numbers in S2.
In other words, we can sort the images by their heights after they’ve loaded in the DOM, and partition them in to a number of sets of columns in which we want to display them. We then use the algorithm to place each image in the column with the smallest sum. This approach isn’t guaranteed to produce the best partitions all of the time, but it’s performant and scales up nicely. I’ve implemented this in React(Codesandbox example) and the results speak for themselves. So much more compact!