in reply to fastest way to compare numerical strings?

An obvious improvement could be to sort your array first. So you can check each value on its neighbors only reducing the tests from N*N to N*M where M is the average population of clusters more 1.

Rule One: "Do not act incautiously when confronting a little bald wrinkly smiling man."

  • Comment on Re: fastest way to compare numerical strings?