What if you spend extra memory to partially process each pair in the order of how likely they are to be the best pair?
Each pair will need to track where it is in the sequence of categories to check next.
In reply to Re: Help thinking about an alternate algorithm
by SuicideJunkie
in thread Help thinking about an alternate algorithm
by Limbic~Region
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |