matrixji
diff --git a/‎Maths/3n+1.py‎
Lines changed: 19 additions & 0 deletions b/‎Maths/3n+1.py‎
Lines changed: 19 additions & 0 deletions
diff --git a/‎Maths/FindMax.py‎
Lines changed: 1 addition & 2 deletions b/‎Maths/FindMax.py‎
Lines changed: 1 addition & 2 deletions
diff --git a/‎Maths/FindMin.py‎
Lines changed: 12 additions & 0 deletions b/‎Maths/FindMin.py‎
Lines changed: 12 additions & 0 deletions
diff --git a/‎Maths/abs.py‎
Lines changed: 18 additions & 0 deletions b/‎Maths/abs.py‎
Lines changed: 18 additions & 0 deletions
diff --git a/‎Maths/absMax.py‎
Lines changed: 22 additions & 0 deletions b/‎Maths/absMax.py‎
Lines changed: 22 additions & 0 deletions
diff --git a/‎Maths/absMin.py‎
Lines changed: 20 additions & 0 deletions b/‎Maths/absMin.py‎
Lines changed: 20 additions & 0 deletions
diff --git a/‎README.md‎
Lines changed: 41 additions & 38 deletions b/‎README.md‎
Lines changed: 41 additions & 38 deletions
diff --git a/‎analysis/compression_analysis/PSNR-example-base.png‎
4.31 MB b/‎analysis/compression_analysis/PSNR-example-base.png‎
4.31 MB
diff --git a/‎analysis/compression_analysis/PSNR-example-comp-10.jpg‎
104 KB b/‎analysis/compression_analysis/PSNR-example-comp-10.jpg‎
104 KB
diff --git a/‎analysis/compression_analysis/example_wikipedia_image.jpg‎
476 KB b/‎analysis/compression_analysis/example_wikipedia_image.jpg‎
476 KB
@@ -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()
@@ -1,8 +1,7 @@
 # NguyenU
 
-import math
 def find_max(nums):
-    max = 0
+    max = nums[0]
     for x in nums:
       if x > max:
         max = x
 
@@ -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()
@@ -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()
@@ -0,0 +1,22 @@
+from 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) < j:
+            j = i
+    return j
+    #BUG: i is apparently a list, TypeError: '<' not supported between instances of 'list' and 'int' in absVal
+
+
+def main():
+    a = [1,2,-11]
+    print(absVal(a)) # = -11
+
+if __name__ == '__main__':
+    main()
@@ -0,0 +1,20 @@
+from 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) < j:
+            j = i
+    return j
+
+def main():
+    a = [1,2,-11]
+    print(absMin(a)) # = 1
+
+if __name__ == '__main__':
+    main()