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.

Sign up for GitHub

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

Jump to bottom

Improve KDE calculation performance #46

Open
Dev-Lan opened this issue Nov 20, 2020 · 0 comments
Open

Improve KDE calculation performance #46

Dev-Lan opened this issue Nov 20, 2020 · 0 comments
Assignees
@Dev-Lan
Labels
performance Something is functional, but slower than desirable

Comments

@Dev-Lan
Copy link
Collaborator

Dev-Lan commented Nov 20, 2020

currently O(nlogn) since it sorts. I don't think this is necessary since it is sampling the big array, could use some sort of linear time approximate sort. At any right, I should just try to find an existing library that does this faster.
@Dev-Lan Dev-Lan self-assigned this Nov 20, 2020
@Dev-Lan Dev-Lan added the performance Something is functional, but slower than desirable label Nov 20, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@Dev-Lan Dev-Lan

Labels
performance Something is functional, but slower than desirable
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@Dev-Lan