I revised my implementation and found out that I have miss a inner loop for t. x and y should be recalculated everytime when t is divisble by 2. I have also included a more readble source for this algorithm.
* Add sol3 for project_euler proble_03
* Update sol3.py
add type hint
remove unused variable
* Format code with psf/black
* add sol3 to project_euler/problem_08, modify the stepsize of the loop,will be faster than sol1
* Python Program that fetches top trending news
* Python Program that fetches top trending news
* Revisions in Fetch BBC News
* psf/black Changes
* Python Program to send slack message to a channel
* Slack Message Revision Changes
* Python Program to check Palindrome String
* Doctest Added
* Python Program to check whether a String is Panagram or not
* Python Program to check whether a String is Panagram or not
* Check Panagram Script Added
* Panagram Script Added
* Anagram Script Changes
* Anagram Alphabet Check Added
* Python Program to fetch github info
* Python Program that fetches top trending news
* Python Program that fetches top trending news
* Revisions in Fetch BBC News
* psf/black Changes
* Python Program to send slack message to a channel
* Slack Message Revision Changes
* Improved Singly Linked List
Added String Representations of Nodes and Linked Lists
Added support for indexing and changing of Node data using indices.
* Added a few comments to Linked Lists
* Reformatted to conform to PEP8
* Added from_sequence.py
Convert a Python List to Linked List comprising of Nodes and return head.
* Added print_reverse.py
Recursive program to print the elements of a Linked List in reverse.
* Change 'is not None' for more Pythonicness
* added RSA_factorization.py
This algorithm can effectively factor RSA large prime N given public key e and private key d.
* Rename RSA_factorization.py to rsa_factorization.py
* Add definitions for d, e, and N
* travis test
* travis pull ID test
* get pr branch test
* retry pr build
* test pushing back - probable git error for origin 'not found'
* github auth?
* add .sh
* chmod
* add index update for permission fix
* run sh for script
* add all
* add pull directory
* fetch pr branch
* swap placement of adding commits
* rotate
* quit trying to update Travis
* formatting leftovers
* Travis CI: Write & print DIRECTORY.md on one line
* Simplified DES
* Add files via upload
Diffie Hellman algorithm to generate a secret key.
* Update sdes.py
* Format code with psf/black and add doctests
* Factors of a number
* Update factors.py
* Fix mypy issue in basic_maths.py
* Fix mypy error in perceptron.py
* def primes(max: int) -> List[int]:
* Update binomial_heap.py
* Add a space
* Remove a space
* Add a space
* 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
