-
-
Notifications
You must be signed in to change notification settings - Fork 28
Add a .github action to build DIRECTORY.md #36
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
Conversation
d00a748 to
d94cdc8
Compare
11056ed to
fb55f7f
Compare
cb4c9cf to
f013597
Compare
Add Gitpod badge and prebuilds for all branches and forks
* Add binary search * Update binary search: add recursive version * Update binary search: better description * Update binary search: update runnableExamples * Update binary search: improve tests, add overload for recursive func * Update binary search: evaluate if-expression into result * grammar * Update binary search: improve description, add comments * Update binary search: add missing test cases * Update binary search: add info about pivot choice in description, rearrange it * Update binary search: change int to Natural * Update binary search: if block -> guard clause * Update binary search: test cases * Update binary search: simplify docs * Update binary search: nimpretty
Co-authored-by: David Leal <[email protected]>
Co-authored-by: David Leal <[email protected]>
* Add a sample of maths basic algorithms * Update maths/abs.nim Co-authored-by: Zoom <[email protected]> * Use openArray in absMaxSort Co-authored-by: Zoom <[email protected]> * Fix seq->openArray and int->SomeInteger * Use Positive as input instead * Update maths/addition_without_arithmetic.nim Co-authored-by: Pietro Peterlongo <[email protected]> * Name allocation number * [maths/abs] Replace maxAbsSort by signed[Min/Max]Abs * [Aliquot Sum] Add header * Add empty line at end of file * Remove Allocation number since it is a non standard algorithm * Fix titles * Run nimpretty on the files * Rename file and add DIRECTORY.md * abs: Fix variable name * Add export marker Co-authored-by: Zoom <[email protected]> * Add RE block in aliquot sum and improve RE Co-authored-by: Zoom <[email protected]> * Remove MD quotation marks for inline code * Add export marker for RE block * Remove extra ValueError --------- Co-authored-by: Dimitri LESNOFF <[email protected]> Co-authored-by: Zoom <[email protected]> Co-authored-by: Pietro Peterlongo <[email protected]> Co-authored-by: David Leal <[email protected]>
* Use a dynamic allocated array (sequence) for strings * Run nimpretty * Add requested changes * Fix documentation generation * Fix test title according to changes Co-authored-by: Satin Wuker <[email protected]> * Update comments to warn about indexing issues Modified a bit the suggestions of comments. Please check them before approving. Co-authored-by: Zoom <[email protected]> --------- Co-authored-by: Dimitri LESNOFF <[email protected]> Co-authored-by: Satin Wuker <[email protected]> Co-authored-by: Zoom <[email protected]>
…hms#41) This will run `sudo apt-get update` before running any other commands on the Gitpod prebuild image (`.gitpod.dockerfile`).
…s#42) * Update README.md Use more extended markdown syntax instead of HTML, Add Matrix links Superseed PR TheAlgorithms#40 * Actually fix gitter! Move img src links to footer. Also changed the TheAlgorithms logo image link. * Restore TheAlgorithms logo link * More link fixes --------- Co-authored-by: dlesnoff <[email protected]>
Uppercase `directory.md` to `DIRECTORY.md`
* feat: add Levenshtein distance * Apply suggestions from code review Co-authored-by: Zoom <[email protected]> * refactor: use toKey in initSubsolutions * style: use .Natural * style: remove blank line * refactor: add Key type * style: use descriptive variable names * style: use a, b instead of strA, strB * docs: add note about complexity * refator: add name to TestCase * docs: remove sentence about dp * docs: update documentation of `levenshteinDistance` Co-authored-by: Zoom <[email protected]> * docs: rename initLevenshteinDistanceMatrix and add its documentation * refactor: add fillLevenshteinDistanceMatrix * tests: reorganise tests, remove TestCase type * docs: add edit distance to module-level documentation * docs: mention Wagner–Fischer algorithm * docs: add comment in fillLevenshteinDistanceMatrix * style: reformat fillLevenshteinDistanceMatrix * docs: update DIRECTORY.md --------- Co-authored-by: Zoom <[email protected]>
* docs: add missing `#` * docs: update DIRECTORY.md * docs: remove ` of a Circle` Co-authored-by: Zoom <[email protected]> * docs: update DIRECTORY.md --------- Co-authored-by: Zoom <[email protected]>
* Implement Gale-Shapley stable matching This is an adaptation of my much earlier implementation made for the RosettaCode project. The additional requirements of the task were moved to the runnableExamples block. The code was updated, thoroughly checked and commented. The name for the category is similar to one used for earlier C# and Lua implementations. * Add more docs; `Clash` made numerical * Remove repetition in module's RE block --------- Co-authored-by: dlesnoff <[email protected]>
8a7fdf3 to
c00766d
Compare
|
I am sorry, I merged another branch with an algorithm not yet in the repository to see if the action really works and this messed up the history.
Please remove the extra participants from the git message if you merge this PR. |
|
Hey there! Just checking in: do you need any help or would you like me to work on this? Thanks. 🙂 |
|
I am not sure what this PR requires additionally. I prefer to focus on the algorithms themselves. |
|
I made a change to report the eventual error statuses of the compilation or of the execution of the script. |
Panquesito7
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Looks great, thanks! 🚀 Let's test it out.
I never wrote a github action myself before but I try to fix #25 .
There are probably a lot of mistakes.
To do: