* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* some pep8 cleanup too
* ENH: refactored longest common subsequence, also fixed a bug with the sequence returned
* renamed function
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* some pep8 cleanup too
* divide and conquer and brute force algorithms for array-inversions counting
* divide and conquer and brute force algorithms for array-inversions counting
* divide and conquer and brute force algorithms for array-inversions counting
* a naive and divide-and-conquer algorithms for the convex-hull problem
* two convex-hull algorithms, a divide-and-conquer and a naive algorithm
* two convex-hull algorithms, a divide-and-conquer and a naive algorithm
* two convex-hull algorithms, a divide-and-conquer and a naive algorithm
* divide and conquer and brute force algorithms for array-inversions counting
* divide and conquer and brute force algorithms for array-inversions counting
* divide and conquer and brute force algorithms for array-inversions counting
* Added new algorithm which takes points as an input and outputs a polynom connecting them
* Rename Python-Polynom-for-points.py to python-polynom-for-points.py
* Update python-polynom-for-points.py
* Update python-polynom-for-points.py
* Update python-polynom-for-points.py
* Update python-polynom-for-points.py
* Update python-polynom-for-points.py
* Update python-polynom-for-points.py
* Update python-polynom-for-points.py
* Add doctests and run thru psf/black
* Travis CI: Add pytest --doctest-modules neural_network
Fixes#987
```
neural_network/perceptron.py:123: in <module>
sample.insert(i, float(input('value: ')))
../lib/python3.7/site-packages/_pytest/capture.py:693: in read
raise IOError("reading from stdin while output is captured")
E OSError: reading from stdin while output is captured
-------------------------------------------------------------------------------- Captured stdout --------------------------------------------------------------------------------
('\nEpoch:\n', 399)
------------------------
value:
```
* Adding fix from #1056 -- thanks @QuantumNovice
* if __name__ == '__main__':
* pytest --ignore=virtualenv # do not test our dependencies
* added sample file to transfer
* split client and server into separate files
* client and server now work in python2
* server works on python3
* client works on python3
* allow configurable ONE_CONNECTION_ONLY for testing server
* allow testing of ftp server + client
* use f-strings
* removed single letter vars
* fixed bad quote marks
* clearer file handler names
* 'with open() as' syntax
* unicode and emojis in the test data
* s -> sock
* consistent comment spacing
* remove closing formalities
* swap in and out_file
* f-string
* if __name__ == '__main__':
* Create Quadratic Equations(Complexes Numbers)
Created function that solves quadratic equations treating the cases with complexes numbers. Giving an answer with the imaginary unit "i".
* Update Quadratic Equations(Complexes Numbers)
Since there was no response from the owner of this PR, I made this little change which I hope will solve the issue!
* 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
* Unicode test on strings/rabin_karp.py per #1067
* bin(num) can convert ZERO and negative decimal numbers to binary. Consistent with built-in python bin(x) function.
* bin(num) can convert ZERO and negative decimal numbers to binary. Consistent with built-in python bin(x) function.
* Added doctests. bin(num) can convert ZERO and negative decimal numbers to binary. Consistent with built-in python bin(x) function.
* Added doctests. bin(num) can convert ZERO and negative decimal numbers to binary. Consistent with built-in python bin(x) function.
* Added doctests. bin(num) can convert ZERO and negative decimal numbers to binary. Consistent with built-in python bin(x) function.
* doctests still failing.
* Doctests added.
* Update tim_sort.py
Update tim_sort.py
The previous algorithm was skipping numbers, according to issue #959, and my own tests.
The version I am applying uses a while loop, which works correctly and is easier to compute, as there is no break statement.
* Update tim_sort.py
* Add Lucas_Lehmer_primality_test
* Add explanation for Lucas_Lehmer_primality_test
* Update and rename Lucas_Lehmer_primality_test.py to lucas_lehmer_primality_test.py
* LargestOfVeryLargeNumbers
Finds the largest among two very large numbers of the form x^y. Numbers like 512^513 etc
* Rename LargestOfVeryLargeNumbers to LargestOfVeryLargeNumbers.py
* Input() statements have been indented.
input() statements are indented under if __name__ == "__main__":
* largest_of_very_large_numbers.py
* added automated doctest to decimal_to_hexadecimal.py in conversions
* improved error handling and added more test cases in decimal_to_hexadecimal.py
* implemented 0x notation and simplified AssertionError
* fixed negative notation and added comparison test against Python hex function
Both of the two files implemented sieve of eratosthenes.
However, there was a bug in other/finding_primes.py, and the time complexity was larger than the other.
Therefore, remove other/finding_primes.py and add doctest tomaths/sieve_of_eratosthenes.py.
* Added matrix exponentiation approach for finding fibonacci number.
* Implemented the way of finding nth fibonacci.
* Complexity is about O(log(n)*8)
* Updated the matrix exponentiation approach of finding nth fibonacci.
- Removed some extra spaces
- Added the complexity of bruteforce algorithm
- Removed unused function called zerro()
- Added some docktest based on request
* Updated the matrix exponentiation approach of finding nth fibonacci.
- Removed some extra spaces
- Added the complexity of bruteforce algorithm
- Removed unused function called zerro()
- Added some docktest based on request
* Updated Rabin Karp algorithm.
- Previous solution is based on the hash function of python.
- Implemented ruling hash to get the appropriate complexity of rabin karp.
* Updated Rabin Karp algorithm.
- Previous solution is based on the hash function of python.
- Implemented ruling hash to get the appropriate complexity of rabin karp.
* Implemented ruling hash to appropriate complexity of Rabin Karp
Added unit pattern testing
* rotate_matrix.py: Add type hints for return values
@obelisk0114 Your review please?
* Fix typo
* Run the code thru python/black
https://github.com/python/black
* Fix 270 comment
* Simplify with get_data() and test the alternatives
* ) * 3
* Update rotate_matrix.py
* Update rotate_matrix.py
