Greedy

Author: rahulcode22

Greedy/majorityElement.py

@@ -0,0 +1,21 @@
+'''
+Given an array of size n, find the majority element. The majority element is the element that appears more than floor(n/2) times.
+
+You may assume that the array is non-empty and the majority element always exist in the array.
+
+Example :
+
+Input : [2, 1, 2]
+Return  : 2 which occurs 2 times which is greater than 3/2.
+'''
+import math
+def majority(arr):
+    n = len(arr)
+    res = 0
+    for i in arr:
+        if arr.count(i) > math.floor(n/2):
+            res = i
+            break
+    return res
+
+print majority([2,1,2])

Math/Greates-common-divisor.py

@@ -4,12 +4,9 @@
 GCD of 2 integers m and n is defined as the greatest integer g such that g is a divisor of both m and n.
 Both m and n fit in a 32 bit signed integer.
 '''
-    def gcd(self, A, B):
-
-        if B > A:
-
-            A, B = B, A
-        while B:
-
-            A , B = B, A%B
-        return A
+def gcd(a,b):
+    if a < b:
+        a, b = b, a
+    while b:
+        a, b = b, a%b
+return a