That's exactly why I said I would do it for a fee. It's real work correctly doing that sort of mathematical modelling.
I note that your "transitive closure" method does not include a complete solution either.
I also defend an alternative method of properly setting up hash keys (maybe AoA as values?) and doing the conventional cascading hash sort, including a subsort on the AoA's.
It also begs questions like does point difference matter in the wins? Or is it just a binary value. etc. etc.
So I may have flunked your interview......but that's because I'm more creative, or at least differently trained than you.
No offense.... but your transitive sort dosn't really lead to a general purpose solution, and there is no saying whether your transitive method is the best. I admit you are one of the few who have attempted a solution to the team rankings problem.
In reply to Re^5: Adding Special Rules to Sort
by zentara
in thread Adding Special Rules to Sort
by ctfishman
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |