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

Question re N ≥ M #6

Open
drathier opened this issue Oct 18, 2020 · 0 comments
Open

Question re N ≥ M #6

drathier opened this issue Oct 18, 2020 · 0 comments

Comments

@drathier
Copy link

The paper http://myerslab.mpi-cbg.de/wp-content/uploads/2014/06/np_diff.pdf mentions that N ≥ M. I haven't read it all. This library doesn't seem to reorder arguments such that one is always greater than or equal to the other in length. Would that be a performance optimization or is the algorithm symetric and that invariant just there for explaining the O(time) complexity?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@drathier