Skip to content
New issue

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

Find better algorithm for matching #2

Closed
xer0x opened this issue Sep 24, 2019 · 0 comments · Fixed by #3
Closed

Find better algorithm for matching #2

xer0x opened this issue Sep 24, 2019 · 0 comments · Fixed by #3
Assignees

Comments

@xer0x
Copy link
Owner

xer0x commented Sep 24, 2019

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.

@xer0x xer0x self-assigned this Sep 24, 2019
@xer0x xer0x mentioned this issue Sep 27, 2019
@xer0x xer0x closed this as completed in #3 Sep 27, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant