We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
The current algorithm used to find pairs works in O(n^2) time by inspecting all the possible locations.
To improve this, I'm thinking that I could sort the locations by latitude and longitude to avoid having to check all the other locations.
The text was updated successfully, but these errors were encountered:
xer0x
Successfully merging a pull request may close this issue.
The current algorithm used to find pairs works in O(n^2) time by inspecting all the possible locations.
To improve this, I'm thinking that I could sort the locations by latitude and longitude to avoid having to check all the other locations.
The text was updated successfully, but these errors were encountered: