Closed
Conversation
…project_euler/problem_09
* project_euler/problem_09: updating DIRECTORY.md optimized solution using only one loop copied from - https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_09/sol2.py updating DIRECTORY.md brute force method for Euler# 09 # Conflicts: # DIRECTORY.md
# Conflicts: # DIRECTORY.md
took 11ms (cherry picked from commit 54e3cdc92f81bebe8678257916766b5b8af9b2b0)
* project_euler/problem_19: updating DIRECTORY.md Project Euler / Problem 19 # Conflicts: # DIRECTORY.md
* project_euler/problem_21: updating DIRECTORY.md speed optimized solution + optional OpenMP # Conflicts: # DIRECTORY.md
* sorting/shell_sort: add stats for algo 2 and use milliseconds create a duplicate array added new shell-sort algorithm updating DIRECTORY.md +a much faster fibonacci computation algorithm print hashes in HEX add commandline option to FibonacciDP.c print hashes in HEX add commandline option to FibonacciDP.c
* project_euler/problem_22: added source text file updating DIRECTORY.md sort using both lazy sort and shell-sort # Conflicts: # DIRECTORY.md
* project_euler/problem_23: updating DIRECTORY.md move time computation inside loop + comments faster parallleization time computation inside the loop & print loop info added comments sol1 optimized by storing abundant numbers in a condensed array brute-force - compute abundant numbers every time # Conflicts: # DIRECTORY.md
* project_euler/problem_24: algorithm by Dijkstra
* project_euler/problem_25: solution using arbitrary number of digits took 11ms
* project_euler/master2: (26 commits) solution using arbitrary number of digits took 11ms algorithm by Dijkstra updating DIRECTORY.md move time computation inside loop + comments faster parallleization time computation inside the loop & print loop info added comments sol1 optimized by storing abundant numbers in a condensed array brute-force - compute abundant numbers every time added source text file updating DIRECTORY.md sort using both lazy sort and shell-sort add stats for algo 2 and use milliseconds create a duplicate array added new shell-sort algorithm updating DIRECTORY.md speed optimized solution + optional OpenMP added computational time added additional summary updating DIRECTORY.md ...
Auto-build using CMake and CI using Travis-CI
Collaborator
Author
|
the number of changes have surpassed since last opening the pull-request. since no further action was taken, I am closing this pull. |
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.
New
misc/Fibonacci_fast.c: Fast Fibonacci number computation with less memory and processing power using the recursive relations:Updated
misc/Fibonacci_DP.cnow also accepts command-line inputhash/test_program.cnow prints the hash in hexadecimal format