* Added doctest and more explanation about Dijkstra execution.
* tests were not passing with python2 due to missing __init__.py file at number_theory folder
* Removed the dot at the beginning of the imported modules names because 'python3 -m doctest -v data_structures/hashing/*.py' and 'python3 -m doctest -v data_structures/stacks/*.py' were failing not finding hash_table.py and stack.py modules.
* Moved global code to main scope and added doctest for project euler problems 1 to 14.
* Added test case for negative input.
* Changed N variable to do not use end of line scape because in case there is a space after it the script will break making it much more error prone.
* Added problems description and doctests to the ones that were missing. Limited line length to 79 and executed python black over all scripts.
* Changed the way files are loaded to support pytest call.
* Added __init__.py to problems to make them modules and allow pytest execution.
* Added project_euler folder to test units execution
* Changed 'os.path.split(os.path.realpath(__file__))' to 'os.path.dirname()'
* 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
* Moved and renamed ~script.py to scripts/build_directory_md.py
Updated DIRECTORY.MD file
* Modified .travis.yml per suggestion in #1013
* Fixed typo per suggestions in #1013
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
