title: Can we reduce complexity in comparing each user in array with every another?
body: <p>We have an array of users. We want to compare each user with every other user for some reason. Can its complexity be less than n^2 somehow?
  Currently the comparison is taking n^2 complexity. I want it to be less than n^2.</p>