Inductive Pairwise Ranking: Going Beyond the n log(n) Barrier