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

Add the two loops variant of this min heap implementation, which is a slight optimization over the current logic #221

Merged

Conversation

geoffreydstewart
Copy link
Member

Signed-off-by: Geoffrey Stewart geoff.stewart@oracle.com

Description

This is a minor change that splits the existing logic into two loops rather than a single loop containing a conditional instruction.

Motivation

This change makes a small optimization to the exiting logic. The changes has been extensively tested varying the size of the dataset, and the values for k.

… slight optimization over the current logic

Signed-off-by: Geoffrey Stewart <geoff.stewart@oracle.com>
Copy link
Member

@Craigacp Craigacp left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM

@Craigacp Craigacp merged commit c76ef17 into oracle:main Mar 10, 2022
@geoffreydstewart geoffreydstewart deleted the optimize-neighbours-bruteforce branch March 10, 2022 00:26
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 this pull request may close these issues.

None yet

2 participants