Merge pull request ephremdeme#46 from milan090/master

Added isPrime solutions for Python and C

Author: ephremdeme

problems/isPrime.c

@@ -0,0 +1,26 @@
+#include<stdio.h>
+#include<math.h>
+
+int main(){
+  int num, flag = 0;
+  
+  printf("Enter a natural number: ");
+  scanf("%d", &num);
+
+  double sqrtResult = sqrt((double) num);
+
+  for (int i=2; i <= sqrtResult; ++i){
+    if (num%i == 0){
+      flag = 1;
+      break;
+    }
+  }
+  
+  if (flag == 1) {
+    printf("%d is not a prime number\n", num);
+  } else {
+    printf("%d is a prime number\n", num);
+  }
+
+  return 0;
+}

problems/isPrime.py

@@ -0,0 +1,8 @@
+def isPrime(num):
+  print(int(num**0.5))
+  for i in range(2, int(num**0.5)+1):
+    if num%i == 0:
+      return False
+  return True
+
+print(isPrime(int(input(">>Number: "))))

stack/stack.py

@@ -0,0 +1,30 @@
+class Stack:
+  def __init__(self):
+    self._data = []
+    self.size = 0
+  
+  def push(self, value, *args):
+    self._data.append(value)
+    for item in args:
+      self._data.append(item)
+    self.size += 1
+
+  def pop(self):
+    self._data.pop(-1)
+    self.size -= 1
+
+  def peek(self):
+    return self._data[-1]
+
+  def printStack(self):
+    return ('[ ' + ', '.join(map(lambda item: str(item), self._data)) + ']')
+
+myStack = Stack();
+myStack.push(5)
+myStack.push(10)
+myStack.push(89)
+print("Peek:", myStack.peek())
+myStack.pop()
+print("Peek:", myStack.peek())
+print(myStack.printStack())
+