Skip to content

Formula to find median in Binary Search changed #2181

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

Merged
merged 3 commits into from
Apr 14, 2021

Conversation

Souravjyoti
Copy link
Contributor

Describe your change:

Finding median using the previous formula may carry the median value out of range. Therefore, updated the formula with a better one.

References

Checklist:

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized.
  • I know that pull requests will not be merged if they fail the automated tests.
  • This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
  • All new Java files are placed inside an existing directory.
  • All filenames are in all uppercase characters with no spaces or dashes.
  • All functions and variable names follow Java naming conventions.
  • All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
  • If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

Copy link
Member

@realDuYuanChao realDuYuanChao left a comment

Choose a reason for hiding this comment

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

Thanks for your contribution.

@realDuYuanChao realDuYuanChao merged commit b8707e6 into TheAlgorithms:master Apr 14, 2021
@@ -45,7 +45,7 @@
if (right < left) return -1; // this means that the key not found

// find median
int median = (left + right) >>> 1;
int median = left + ((right-left) >>> 1);

Choose a reason for hiding this comment

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

Actually this change is not necessary. Above expression is already using a logical shift (three >>>) which will preserve the sign bit if a potential overflow happens when summing (left + right). For languages like C++ and others that only support arithmetic shift (two >>) above workaround is necessary.

TL;DR original code works fine

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.

3 participants