I'm sure we've all seen this: http://www.contrib.andrew.cmu.edu/~msandbot/pokemon/blackwhite.html
But it seems to be a bit dumb, asking for O(n) comparisons. In the best case we could cut this down to O(log n), though that requires figuring out a way to deal with inconsistent rankings.