{{ message }}
Update garage.py#1
Merged
Merged
Conversation
added 3 commits
December 29, 2016 16:08
Check for the case: initial = [3,1,2,0] final = [2,3,0,1] between state: [3,0,2,1] [0,3,2,1] [2,3,0,1] So only 3 moves needed while yourt program gives five moves.
Owner
Author
danghai
pushed a commit
that referenced
this pull request
Jun 7, 2018
* Requirements.txt: Add requirements dependency for algorithms * Update cache in travis * Switch to use tox and add more env in python for testing * Add MANIFEST.in file * fix travis issue (#1) * Add TODO to PriorityQueue
JKLiang9714
added a commit
to JKLiang9714/algorithms
that referenced
this pull request
Mar 29, 2019
update from keon
keon
pushed a commit
that referenced
this pull request
Mar 6, 2021
* feat:(first draft for the misra gries algorithm) #1 * feat:(Added examples and changed to correct name) #1 * feat:(Added init file for testing) #2 * test:(Added tests for misras_gries function) #2 * feat:(add 1-sparse recovery algorithm) #7 * Add finalized 1-sparse-recovery algorithm * Renamed sparse function name to work with import * Tests added for 1-sparse-recovery function * Tests added for 1-sparse-recovery function Co-authored-by: callmeGoldenboy <natanteferi@gmail.com>
keon
added a commit
that referenced
this pull request
Mar 8, 2021
* feat:(first draft for the misra gries algorithm) #1 * feat:(Added examples and changed to correct name) #1 * feat:(Added init file for testing) #2 * test:(Added tests for misras_gries function) #2 * add misra-gries reference * add correct reference to misra_gries * add misra_gries import Co-authored-by: Anders Renström <anders.renstroom@gmail.com> Co-authored-by: Keon <kwk236@gmail.com>
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
2 participants
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.
Check for the case where initial and final states are given below:
initial = [3,1,2,0]
final = [2,3,0,1]
between state:
[3,0,2,1]
[0,3,2,1]
[2,3,0,1]
So only 3 moves needed while yourt program gives 5 moves.