-
-
Notifications
You must be signed in to change notification settings - Fork 46.8k
revert 22 patch #368
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
Closed
revert 22 patch #368
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
Revert "Update bubble_sort.py"
noqa to silence flake8 on Python 3 only syntax
insert_tail(Head.next, data) --> Head.next.insert_tail(data) Fixes: $ __flake8 . --count --select=E901,E999,F821,F822,F823 --show-source --statistics__ ``` ./data_structures/LinkedList/singly_LinkedList.py:14:13: F821 undefined name 'insert_tail' insert_tail(Head.next, data) ^ 1 F821 undefined name 'insert_tail' ``` Also formats the code to be compliant with [PEP8](http://pep8.org).
Modernize Python 2 code to get ready for Python 3 AGAIN
Fix unresolved name: insert_tail()
My solution to the problem
In binary_search_by_recursion, if you search array for a value that does not exist, you will get this error: RecursionError: maximum recursion depth exceeded in comparison To fix this, first check to make sure that the value is between left and right points like this: if (right < left): return None A similar construct has already been applied to binary_search, but did not exist in the recursive alternative.
Fixed recursion error in binary_search_by_recursion
A small edit. Average case for quicksort changed from O(n^2) to O(n log n). Sited: https://en.wikipedia.org/wiki/Quicksort
Updated average case for Quicksort
…ndTraper-master
Array implementation
Update Arrays
Maths/numerical intergration
Maths/numerical intergration
MatrixChainOrder
quicksort_3_partition
Create new cipher - Elgamal cipher key generator
Break if the collection is sorted
__raw_input()__ was removed in Python 3 in favor of __input()__. This change ensure similar functioning in both Python 2 and Python 3.
print() is a function in Python 3
Properly define raw_input() in Python 3
refactor-segment-tree
typo: strip
Added a test case check knapsack.py
Made a typo writing name instead of __name__
Added a function which implements knapsack using memory functions. Also I updated the test cases to include test cases for the memory function implementation.
Added test case to knapsack.py
Changed name to __name__. Sorry for the typo!
Thanks for contributing
typo fix: renamed `NeutonMethod.py` to `NewtonMethod.py`
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.
No description provided.