Merge branch 'master' into improved_sorting_algo

Author: YasirChoudhary

.gitignore

@@ -7,6 +7,7 @@ __pycache__/
 *.so
 
 # Distribution / packaging
+.vscode/
 .Python
 env/
 build/

.vscode/settings.json

@@ -1,7 +1,7 @@
-import math
 import numpy
 
-def LUDecompose (table): #table that contains our data
+def LUDecompose (table):
+    #table that contains our data
     #table has to be a square array so we need to check first
     rows,columns=numpy.shape(table)
     L=numpy.zeros((rows,columns))
@@ -31,4 +31,4 @@ def LUDecompose (table): #table that contains our data
 matrix =numpy.array([[2,-2,1],[0,1,2],[5,3,1]])
 L,U = LUDecompose(matrix)
 print(L)
-print(U)
+print(U)

ArithmeticAnalysis/LUdecomposition.py

@@ -1,27 +1,25 @@
-# Implementing Newton Raphson method in python
+# Implementing Newton Raphson method in Python
 # Author: Haseeb
 
 from sympy import diff
 from decimal import Decimal
-from math import sin, cos, exp
 
 def NewtonRaphson(func, a):
     ''' Finds root from the point 'a' onwards by Newton-Raphson method '''
     while True:
-        x = a
         c = Decimal(a) - ( Decimal(eval(func)) / Decimal(eval(str(diff(func)))) )
 
-        x = c
         a = c
+
         # This number dictates the accuracy of the answer
         if  abs(eval(func)) < 10**-15:
             return  c
 
 
 # Let's Execute
 if __name__ == '__main__':
-    # Find root of trignometric fucntion
-    # Find value of  pi
+    # Find root of trigonometric function
+    # Find value of pi
     print ('sin(x) = 0', NewtonRaphson('sin(x)', 2))
 
     # Find root of polynomial
@@ -30,7 +28,7 @@ def NewtonRaphson(func, a):
     # Find Square Root of 5
     print ('x**2 - 5 = 0', NewtonRaphson('x**2 - 5', 0.1))
 
-    #  Exponential Roots
+    # Exponential Roots
     print ('exp(x) - 1 = 0', NewtonRaphson('exp(x) - 1', 0))
 
 

ArithmeticAnalysis/NewtonRaphsonMethod.py

@@ -1,8 +1,6 @@
 from __future__ import print_function
 import heapq
 import numpy as np
-import math
-import copy
 
 try:
     xrange          # Python 2

Multi_Hueristic_Astar.py renamed to Graphs/Multi_Hueristic_Astar.py

@@ -140,7 +140,7 @@ def dijk(G, s):
 
 
 def topo(G, ind=None, Q=[1]):
-    if ind == None:
+    if ind is None:
         ind = [0] * (len(G) + 1) 		# SInce oth Index is ignored
         for u in G:
             for v in G[u]:

Graphs/basic-graphs.py

@@ -62,9 +62,13 @@ def eulerPhi(n):
         s *= (x - 1)/x 
     return s   
 
-print(primeFactors(100))
-print(numberOfDivisors(100))
-print(sumOfDivisors(100))
-print(eulerPhi(100))
+def main():
+    print(primeFactors(100))
+    print(numberOfDivisors(100))
+    print(sumOfDivisors(100))
+    print(eulerPhi(100))
+    
+if __name__ == '__main__':
+    main()
 
 

Maths/BasicMaths.py

@@ -0,0 +1,18 @@
+# Fibonacci Sequence Using Recursion
+
+def recur_fibo(n):
+    return n if n <= 1 else (recur_fibo(n-1) + recur_fibo(n-2))
+    
+def isPositiveInteger(limit):
+    return limit >= 0
+
+def main():
+    limit = int(input("How many terms to include in fibonacci series: "))
+    if isPositiveInteger(limit):
+        print(f"The first {limit} terms of the fibonacci series are as follows:")
+        print([recur_fibo(n) for n in range(limit)])
+    else:
+        print("Please enter a positive integer: ")
+
+if __name__ == '__main__':
+    main()

Maths/FibonacciSequenceRecursion.py

@@ -0,0 +1,15 @@
+# Greater Common Divisor - https://en.wikipedia.org/wiki/Greatest_common_divisor
+def gcd(a, b):
+    return b if a == 0 else gcd(b % a, a)
+
+def main():
+    try:
+        nums = input("Enter two Integers separated by comma (,): ").split(',')
+        num1 = int(nums[0]); num2 = int(nums[1])
+    except (IndexError, UnboundLocalError, ValueError):
+        print("Wrong Input")
+    print(f"gcd({num1}, {num2}) = {gcd(num1, num2)}")
+
+if __name__ == '__main__':
+    main()
+

Maths/GreaterCommonDivisor.py

@@ -25,7 +25,7 @@ def __init__(self, sample, exit, learn_rate=0.01, epoch_number=1000, bias=-1):
         self.col_sample = len(sample[0])
         self.weight = []
 
-    def trannig(self):
+    def training(self):
         for sample in self.sample:
             sample.insert(0, self.bias)
 
@@ -121,4 +121,4 @@ def sign(self, u):
     sample = []
     for i in range(3):
         sample.insert(i, float(input('value: ')))
-    network.sort(sample)
+    network.sort(sample)

Maths/fibonacciSeries.py

@@ -3,7 +3,6 @@
 Given N, Check if there exists any Pythagorean triplet for which a+b+c=N
 Find maximum possible value of product of a,b,c among all such Pythagorean triplets, If there is no such Pythagorean triplet print -1."""
 #!/bin/python3
-import sys
 
 product=-1
 d=0

Maths/gcd.py

@@ -1,5 +1,5 @@
 from __future__ import print_function
-from math import factorial, ceil
+from math import factorial
 
 def lattice_paths(n):
 	n = 2*n #middle entry of odd rows starting at row 3 is the solution for n = 1, 2, 3,...