Changing the boolean expression avoids the use of a continue statement.
This way the code becomes easier/faster to compute on lower level and it has a
better coding style.
* add gaussian filter algorithm and lena.jpg
* add img_convolve algorithm and sobel_filter
* add canny edge detection algorithm and modify sobel_filter
* format to avoid the backslashes
* Pytest the entire repo
* Do each directory for now...
* YAML files hate tabs
* Add more requirements
* pip install opencv-python
* Comment out FTP
* Add pandas and sklearn to requirements
* Comment out FTP, graphs, machine_learning, maths, neural_network, project_euler
* Update .travis.yml
* Comment out Data structures
* if __name__ == "__main__":
* pytest --ignore=
* pytest .
* Update .travis.yml
* pytest . --doctest-modules --ignore=${IGNORE}
* Ignore --ignore because it just hangs
* Create text file for numbers
* Create sol2.py
* Pythonic version of Problem #16 solution
* Update sol2.py
* Valid Python code for Python version 2-3
* Update sol2.py
`error = abs(f(a))` was declared on line 24 and line 32. It is unnecessary to have in both places.
I removed the second instance since it wastes resources to keep redefining the variable inside the for loop.
This fixes an [issue found by lgtm](66c4afbd0f/files/maths/newton_raphson.py)
* Added print function into matrix_multiplication_addition.py and removed blank space in data_structures/binary tree directory
* Removed .vs/ folder per #893
* Rename matrix_multiplication_addition.py to matrix_operation.py
* Added main() function and simplified password generation.
* Modified password_generator.py file according to suggestions in #968
* minimax.py
minimax algorithm is used for game like tic tac toe. It traces the path and selects the optimal move.
* minimax.py
Minimax is used in decision making and game theory to find the optimal move for a player, when your opponent also plays optimally. It is widely used in games like Tic-Tac-Toe, Chess.
* Delete minimax.py
* Update minimax.py
* Minimax is a backtracking algorithm that is used in game theory to find the optimal move for a player, assuming that your opponent also plays optimally
* Fix typo
* Add all_permutations algorithm to backtracking directory
* Update backtracking and D&C algorithms in README
Update backtracking and divide_and_conquer algorithms in README
* Remove the duplicated file
* Wrote most of an rbt, missing just removal
* Added some convenience methods.
* Added a color method
* Wrote code to delete, but has issues :(
* Fixed a bug in Red-Black trees
* Fixed bug in tree color validation and delete repairing
* Clean up == comparison to None
* Create average_median.py
I created a program to calculate the median of a list of numbers.
* Changed Odd to Even in String
* Create decimal_to_binary.py
- Added 'conversions' folder.
- Created a decimal to binary converter.
* Implemented Decimal to Octal Algorithm
- I created a decimal to octal converter based on the converter in the TheAlgorithms/Python project.
- I added two newlines to make the output of decimal_to_binary.py better.
* Added print function into matrix_multiplication_addition.py and removed blank space in data_structures/binary tree directory
* Removed .vs/ folder per #893
* Rename matrix_multiplication_addition.py to matrix_operation.py
* Added '~script.py' to ignore files and updated DIRECTORY.md
* created divide_and_conquer folder and added max_sub_array_sum.py under it (issue #817)
* additional file in divide_and_conqure (closest pair of points)
* Added Whitespace and Docstring
I modified the file to make Pylint happier and make the code more readable.
* Beautified Code and Added Docstring
I modified the file to make Pylint happier and make the code more readable.
* Added DOCSTRINGS, Wikipedia link, and whitespace
I added DOCSTRINGS and whitespace to make the code more readable and understandable.
* Improved Formatting
* Wrapped comments
* Fixed spelling error for `movement` variable
* Added DOCSTRINGs
* Improved Formatting
* Corrected whitespace to improve readability.
* Added docstrings.
* Made comments fit inside an 80 column layout.
Since `j` is redefined before it is used, it makes more sense to declare it with the value `None` instead of `1`.
This fixes a [warning from lgtm](66c4afbd0f/files/other/primelib.py)
