Anonymous user
Best shuffle: Difference between revisions
→{{header|Crystal}}
Line 1,210:
# k sorts letters from low to high count
# k = g.sort_by { |k, v| v.length }.map { |k, v| k } # in Ruby
# k = g.to_a.sort_by { |
k = g.to_a.sort_by { |h| h[1].size }.map { |h| h[0] } # Crystal shorter
until g.empty?
| |||