Added three randomized algorithms: Reservoir sampling, Random quicksort, Miller-Rabin primality test#13493
Closed
Mishu03 wants to merge 2 commits intoTheAlgorithms:masterfrom
Closed
Added three randomized algorithms: Reservoir sampling, Random quicksort, Miller-Rabin primality test#13493Mishu03 wants to merge 2 commits intoTheAlgorithms:masterfrom
Mishu03 wants to merge 2 commits intoTheAlgorithms:masterfrom
Conversation
…rt, Miller-Rabin primality Test
for more information, see https://pre-commit.ci
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Add Three Randomized Algorithms
This PR introduces three new randomized algorithms to the repository:
Reservoir Sampling – Randomly selects k items from a stream of unknown length.
Randomized QuickSort – Sorts a list using QuickSort with a randomly chosen pivot for better average-case performance.
Miller-Rabin Primality Test – Probabilistic algorithm to check if a number is prime.
All implementations follow Python 3.13+ standards, include type hints, docstrings, and doctests, and return results without printing. The code is fully compliant with repository guidelines and ready for automated testing via GitHub Actions.