I assume this is an issue between one using heap mem and other done on stack, but why such big performance difference? Code is twice as slow using `[x, y].min`

vs `{x, y}.min`

.

See: https://rosettacode.org/wiki/Hamming_numbers#Crystal

```
h << [x2, [x3, x5].min].min # much slower
h << {x2, {x3, x5}.min}.min # faster
h << (x3 < x5 ? (x2 < x3 ? x2 : x3) : (x2 < x5 ? x2 : x5)) # fastest
```