Python-Script-sample

Author: moleculax

License

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2016 The Algorithms
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

Maths/3n+1.py

@@ -0,0 +1,19 @@
+def main():
+    def n31(a):# a = initial number
+        c = 0
+        l = [a]
+        while a != 1:
+            if a % 2 == 0:#if even divide it by 2
+                a = a // 2
+            elif a % 2 == 1:#if odd 3n+1
+                a = 3*a +1
+            c += 1#counter
+            l += [a]
+
+        return l , c
+    print(n31(43))
+    print(n31(98)[0][-1])# = a
+    print("It took {0} steps.".format(n31(13)[1]))#optional finish
+
+if __name__ == '__main__':
+    main()

Maths/FindMax.py

@@ -0,0 +1,14 @@
+# NguyenU
+
+def find_max(nums):
+    max = nums[0]
+    for x in nums:
+      if x > max:
+        max = x
+    print(max)
+
+def main():
+  find_max([2, 4, 9, 7, 19, 94, 5])
+
+if __name__ == '__main__':
+  main()

Maths/FindMin.py

@@ -0,0 +1,12 @@
+def main():
+    def findMin(x):
+        minNum = x[0]
+        for i in x:
+            if minNum > i:
+                minNum = i
+        return minNum
+
+    print(findMin([0,1,2,3,4,5,-3,24,-56])) # = -56
+
+if __name__ == '__main__':
+    main()

Maths/abs.py

@@ -0,0 +1,18 @@
+def absVal(num):
+    """
+    Function to fins absolute value of numbers.
+    >>absVal(-5)
+    5
+    >>absVal(0)
+    0
+    """
+    if num < 0:
+        return -num
+    else:
+        return num
+
+def main():
+    print(absVal(-34)) # = 34
+
+if __name__ == '__main__':
+    main()

Maths/absMax.py

@@ -0,0 +1,27 @@
+from Maths.abs  import absVal
+
+def absMax(x):
+    """
+    #>>>absMax([0,5,1,11])
+    11
+    >>absMax([3,-10,-2])
+    -10
+    """
+    j =x[0]
+    for i in x:
+        if absVal(i) > absVal(j):
+            j = i
+    return j
+    #BUG: i is apparently a list, TypeError: '<' not supported between instances of 'list' and 'int' in absVal
+    #BUG fix
+
+def main():
+    a = [-13, 2, -11, -12]
+    print(absMax(a)) # = -13
+
+if __name__ == '__main__':
+    main()
+
+"""
+print abs Max
+"""

Maths/absMin.py

@@ -0,0 +1,20 @@
+from Maths.abs import absVal
+def absMin(x):
+    """
+    # >>>absMin([0,5,1,11])
+    0
+    # >>absMin([3,-10,-2])
+    -2
+    """
+    j = x[0]
+    for i in x:
+        if absVal(i) < absVal(j):
+            j = i
+    return j
+
+def main():
+    a = [-3,-1,2,-11]
+    print(absMin(a))  # = -1
+
+if __name__ == '__main__':
+    main()

Maths/find_hcf.py

@@ -0,0 +1,22 @@
+# Program to find the HCF of two Numbers
+def find_hcf(num_1, num_2):
+    if num_1 == 0:
+        return num_2
+    if num_2 == 0:
+        return num_1
+    # Base Case
+    if num_1 == num_2:
+        return num_1
+    if num_1 > num_2:
+        return find_hcf(num_1 - num_2, num_2)
+    return find_hcf(num_1, num_2 - num_1)
+
+
+def main():
+    num_1 = 24
+    num_2 = 34
+    print('HCF of %s and %s is %s:' % (num_1, num_2, find_hcf(num_1, num_2)))
+
+
+if __name__ == '__main__':
+    main()

Maths/find_lcm.py

@@ -0,0 +1,17 @@
+def find_lcm(num_1, num_2):
+    max = num_1 if num_1 > num_2 else num_2
+    while (True):
+        if ((max % num_1 == 0) and (max % num_2 == 0)):
+            break
+        max += 1
+    return max
+
+
+def main():
+    num_1 = 12
+    num_2 = 76
+    print(find_lcm(num_1, num_2))
+
+
+if __name__ == '__main__':
+    main()