Let's say we have 100 keys. It would find the best divided number for our rows (since we want 3 rows the best it can do is 33 per row but the extra 1 or 2 would have to be printed in the first or second column.
Difficult thing is, it needs to be sorted A-Z for each column, not row. So it has to be
instead ofa e i b f j c g k d h l
Anyone have ideas on how to do this? thanks!a b c d e f
In reply to table sorting of hashes by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |