-
-
Notifications
You must be signed in to change notification settings - Fork 4.7k
Automatic documentation generation using Doxygen and GitHub hooks #539
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
Closed
Conversation
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
# Project Euler solutions ## [Problem 08](https://projecteuler.net/problem=8) * `sol1.c1` uses brute-force method, reads the digits `num_digits` times. It requires `num_digits^2` multiplication operations. * `sol2.c` is optimized and requires only one read and `num_digits` multiplications and `num_digits` divisions. ## [Problem 09](https://projecteuler.net/problem=9) Two solution - `sol1.c` uses brute force search and `sol2.c` simplifies the search by creating relations of two unknowns `b` and `c` in terms of the search parameter `a`. ## [Problem 10](https://projecteuler.net/problem=10) * update `.gitignore` to ignore build outputs (*.exe files on windows OS) and visual studio code config folder. * `sol1.c` uses brute force sequential method to search for primes and requires multiple loops. * `sol2.c` uses Sieve of Eratosthenes to simplify the search for primes. ## [Problem 12](https://projecteuler.net/problem=12) * compute triangle numbers on the fly and uses a half-loop search for divisors. ## [Problem 13](https://projecteuler.net/problem=13) * implemented using numbers of arbitrary length, limited only by memory constrains and time. ## [Problem 14](https://projecteuler.net/problem=14) * optimized solution with an option to compile using OpenMP for parallelization ## [Problem 15](https://projecteuler.net/problem=15) * compute triangle numbers on the fly and uses a half-loop search for divisors. ## [Problem 16](https://projecteuler.net/problem=16) * computes any power of 2 and the sum of its digits.
(cherry picked from commit 0cbea99)
(cherry picked from commit be4c47c)
Collaborator
Author
|
wrong pull request. Was creating to a personal fork. Nonetheless, @cclauss this could be a good way to keep track of files and the algorithms themselves instead of Directory.md which, I don't see any particular use for. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Documentation viewable at: https://kvedala.github.io/C/
Documentation updated automatically on push to master branch