* Doctest and comment for maximum sub-array problem
More examples and description for max_sub_array.py
* Update max_sub_array.py
* Update max_sub_array.py
* Fix doctest
* Update morse_code_implementation.py
* Delete porta_cipher.py
* Update mixed_keyword_cypher.py
* Mixed keyword cypher added
* issue with mixed keyword fixed
* no math included
* hardcoded inputs
* porta cypher added
* porta cypher added
* commented in mixed keyword according to contrib.md
* Fixes in methods and tests
* Renamed tests.py to test_linear_algebra.py
* removed force_test()
* Delete test_linear_algebra.py
* Format code with psf/black
* Rename tests.py to test_linear_algebra.py
* Added determinate function
* Changed determinate function name
* Changed instance of .det() to .determinate()
* Added force_test() function
* Update tests.py
* create simnple binary search
#A binary search implementation to test if a number is in a list of elements
* Add .py, format with psf/black, and add doctests
* introduced shuffled_shift_cipher.py in /ciphers
* made requested changes
* introduced doctests, type hints
removed __make_one_digit()
* test_end_to_end() inserted
* Make test_end_to_end() a test ;-)
* Another method added for GCD
* Now doctest fulfilled for added method.
* Update greatest_common_divisor.py
* Now unnecessary white spaces removed.
* Cycle_Detection_Undirected_Graph
Cycle_Detection_Undirected_Graph using Disjoint set DataStructure
* Update greatest_common_divisor.py again
* Again Updated cycle_detection_undirected_graph.py
* Delete cycle_detection_undirected_graph.py
* Add doctests and format the code with psf/black
* fixup: Typo
* Update greatest_common_divisor.py
* greatest_common_divisor()
* Create newton_forward_interpolation.py
This code is for calculating newton forward difference interpolation for fixed difference.
* Add doctests and reformat with black
* some pytest on math folder
* Run the test function via a doctest
Also format the code with psf/black as discussed in CONTRIBUTING.md
* Update abs.py
* Update average_mean.py
* Create autocomplete_using_trie.py
The program aims to design a trie implementation for autocomplete which is easy to understand and ready to run.
* Removed unused import
* Updated the list value
* Update autocomplete_using_trie.py
* Run the code through Black and add doctest
* Implementation of Hardy Ramanujan Algorithm
* added docstrings
* added doctests
* Run Python black on the code
* Travis CI: Upgrade to Python 3.8
* Revert to Python 3.7
* Python program that scrufs 3 site at a time
add input in the compiling time like -- python3 project1.py (man)
* Update project1.py
* noqa: F401 and reformat with black
* Rename project1.py to web_programming/crawl_google_results.py
* Add beautifulsoup4 to requirements.txt
* Add fake_useragent to requirements.txt
* Update crawl_google_results.py
* headers={"UserAgent": UserAgent().random}
* html.parser, not lxml
* link, not links
