Daniel.
Daniel.
[](https://gitpod.io/from-referrer/) [know more](https://www.gitpod.io/docs/pull-requests/) ### Describe your change: - [x] Add an algorithm? - [ ] Fix a bug or typo in an existing algorithm? - [ ] Documentation change?...
[](https://gitpod.io/from-referrer/) [know more](https://www.gitpod.io/docs/pull-requests/) ### Describe your change: - [x] Add an algorithm? - [ ] Fix a bug or typo in an existing algorithm? - [ ] Documentation change?...
This algorithm is a distinct implementation of the current sieve in the repo because this returns an array of integers that only contain prime numbers. [](https://gitpod.io/from-referrer/) [know more](https://www.gitpod.io/docs/pull-requests/) ###...
[](https://gitpod.io/from-referrer/) [know more](https://www.gitpod.io/docs/pull-requests/) ### Describe your change: - [x] Add an algorithm? - [ ] Fix a bug or typo in an existing algorithm? - [ ] Documentation change?...
Creation of Project Euler folder and solution for problem 1 Tests and benchmarks added
This is a reimplementation for the algorithm sieve of erathosthenes, this reimplementation doesn't use channels and has a better performance than the actual sieve in the repository. Benchmarks for `limit=10000`...
Hi team, this is my [DSA](https://en.wikipedia.org/wiki/Digital_Signature_Algorithm) implementation. This PR needs a little bit of context. I tried to follow the exact same algorithm steps as Wikipedia says but this has...
As the title says, this PR is for those test that aren't compliant with the lint in the pipeline. Hope this can help to others PR's :)
Hey, first, thanks for this repo! I'm a rust beginner and to be honest I want to use it for some embedded programming hobby, no professional use right now. So...