extra class removal and cleanup

extra class removal and cleanup.

Author: Hemant-Jain-Author

.gitignore

@@ -0,0 +1 @@
+/.metadata/

Algorithms/Fibo.py

@@ -1,23 +1,24 @@
-class Prime(object):  
-    @classmethod
-    def main(cls, args):
-        print(cls.isPrime(50))
-        print(cls.isPrime(47))
-    
-    @classmethod
-    def isPrime(self, n):
-        if( n > 1):
-            answer = True
-        else:
-            answer = False
-        i = 2
-        while(i*i <= n):
-            if(n%i == 0):
-                answer = False
-                break
-            i += 1
-        return answer     
+def fibonacci2(n):
+    if n <= 1:
+        return n
+    return fibonacci(n - 1) + fibonacci(n - 2)
 
-if __name__ == '__main__':
-    import sys
-    Prime.main(sys.argv)
+   
+def fibonacci(n):
+    first = 0
+    second = 1
+    if (n == 0):
+        return first;
+    elif (n == 1):
+        return second;
+    i = 2
+    while(i <= n):
+        temp = first + second
+        first = second
+        second = temp
+        i += 1
+    return temp
+
+
+print(fibonacci(50))
+print(fibonacci2(50))

Algorithms/NQueen.py

@@ -1,41 +1,22 @@
-#!/usr/bin/env python
+def Feasible(Q, k):
+    i = 0
+    while i < k:
+        if Q[k] == Q[i] or abs(Q[i] - Q[k]) == abs(i - k):
+            return False
+        i += 1
+    return True
 
-class NQueen(object):
-    @classmethod
-    def printArr(cls, Q, n):
-        i = 0
-        while i < n:
-            print(Q[i])
-            i += 1
-        print("")
+def NQueens(Q, k, n):
+    if k == n:
+        print (Q)
+        return
+    i = 0
+    while i < n:
+        Q[k] = i
+        if Feasible(Q, k):
+            NQueens(Q, k + 1, n)
+        i += 1
 
-    @classmethod
-    def Feasible(cls, Q, k):
-        i = 0
-        while i < k:
-            if Q[k] == Q[i] or abs(Q[i] - Q[k]) == abs(i - k):
-                return False
-            i += 1
-        return True
 
-    @classmethod
-    def NQueens(cls, Q, k, n):
-        if k == n:
-            cls.printArr(Q, n)
-            return
-        i = 0
-        while i < n:
-            Q[k] = i
-            if cls.Feasible(Q, k):
-                cls.NQueens(Q, k + 1, n)
-            i += 1
-
-
-    @classmethod
-    def main(cls, args):
-        Q = [0] * 8
-        cls.NQueens(Q, 0, 8)
-        
-if __name__ == '__main__':
-    import sys
-    NQueen.main(sys.argv)
+Q = [0] * 8
+NQueens(Q, 0, 8)

Algorithms/Prime.py

@@ -1,45 +1,15 @@
-class Fibo(object):
-    
-    @classmethod
-    def main(cls, args):
-        print(cls.fibonacci(50))
-        print(cls.fibonacci2(50))
-
-    @classmethod
-    def fibonacci2(cls, n):
-        if n <= 1:
-            return n
-        return cls.fibonacci(n - 1) + cls.fibonacci(n - 2)
-    
-    @classmethod
-    def fibonacci(cls, n):
-        first = 0
-        second = 1
-        if (n == 0):
-            return first;
-        elif (n == 1):
-            return second;
-        i = 2
-        while(i <= n):
-            temp = first + second
-            first = second
-            second = temp
-            i += 1
-        return temp
-    
-    def isPrime(self, n):
-        if( n > 1):
-            answer = True
-        else:
+def isPrime(n):
+    if(n > 1):
+        answer = True
+    else:
+        answer = False
+    i = 2
+    while(i*i <= n):
+        if(n % i == 0):
             answer = False
-        i = 2
-        while(i*i <= n):
-            if(n%i == 0):
-                answer = True;
-                break;
-            i += 1
-        return answer     
+            break
+        i += 1
+    return answer
 
-if __name__ == '__main__':
-    import sys
-    Fibo.main(sys.argv)
+print(isPrime(50))
+print(isPrime(47))

Algorithms/TOH.py

@@ -1,31 +1,12 @@
-#!/usr/bin/env python
-""" generated source for module TOH """
-
-class TOH(object):
-    """ generated source for class TOH """
-    
-    @classmethod
-    def main(cls, args):
-        """ generated source for method main """
-
-        cls.TowersOfHanoi(3)
-
-    @classmethod
-    def TOHUtil(cls, num, source, dest, temp):
-        """ generated source for method TOHUtil """
-        if num < 1:
-            return
-        cls.TOHUtil(num - 1, source, temp, dest)
-        print("Move disk" , num , "from peg" , source , "to peg" , dest)
-        cls.TOHUtil(num - 1, temp, dest, source)
-
-    @classmethod
-    def TowersOfHanoi(cls, num):
-        """ generated source for method TowersOfHanoi """
-        print("The sequence of moves involved in the Tower of Hanoi are :")
-        cls.TOHUtil(num, 'A', 'C', 'B')
-
-
-if __name__ == '__main__':
-    import sys
-    TOH.main(sys.argv)
+def TOHUtil(num, source, dest, temp):
+    if num < 1:
+        return
+    TOHUtil(num - 1, source, temp, dest)
+    print("Move disk" , num , "from peg" , source , "to peg" , dest)
+    TOHUtil(num - 1, temp, dest, source)
+
+def TowersOfHanoi(num):
+    print("The sequence of moves involved in the Tower of Hanoi are :")
+    TOHUtil(num, 'A', 'C', 'B')
+
+TowersOfHanoi(3)