Skip to content

Add BFPRT algorithm#2590

Merged
siriak merged 4 commits into
TheAlgorithms:masterfrom
IbarakiRino:AbnerHung-patch-1
Oct 13, 2021
Merged

Add BFPRT algorithm#2590
siriak merged 4 commits into
TheAlgorithms:masterfrom
IbarakiRino:AbnerHung-patch-1

Conversation

@IbarakiRino

Copy link
Copy Markdown
Contributor

Fixes: #2586

get Min K numbers By BFPRT

Describe your change:

  • Add an algorithm?
  • Fix a bug or typo in an existing algorithm?
  • Documentation change?

References

Blum M, Floyd R W, Pratt V R, et al. Time bounds for selection[J]. J. Comput. Syst. Sci., 1973, 7(4): 448-461.

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}.

@IbarakiRino IbarakiRino requested a review from siriak as a code owner October 13, 2021 04:32
@IbarakiRino

Copy link
Copy Markdown
Contributor Author

@siriak Hi there! Could you please add the label of hacktoberfest-accepted for this pr?

@siriak siriak left a comment

Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

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

The build is failing, could you fix that?

@IbarakiRino

Copy link
Copy Markdown
Contributor Author

I will try to fix

@siriak siriak merged commit 71c91a1 into TheAlgorithms:master Oct 13, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Add an O(n) solution for Top K Frequent Elements problem

2 participants