correct logic in perfect..min size search

[kspearrin]

I believe I found the error in your logic for determining the correct min size. You have a comment there that describes what you wanted, but the logic did not match.

The current code does not compare against the max or perfect range when searching for the biggest icon that is > min. Since the icons are sorted in descending order for this iterator, you will always get the largest icon from the list (which is the first one in the for loop). This confirms the behavior I am seeing in #28.

Note: I am not a go developer and I was not able to run and test this code. I do, however, know how to read boolean logic 😃 . Please double check my work and syntax (I just copy/pasted and tweaked from the above logic).

resolves #28

[mat]

Wow, what a good catch, thank you!

I'm going to add a test for this and add you to the list of contributors.