update

Author: Blooverh

PythonDataStructsAndAlgo/Chapter2/creditCard.py

@@ -0,0 +1,40 @@
+"""Example of a class for a credit card"""
+class CreditCard:
+    """Think of this function as a constructor method in java"""
+    def __init__(self, customer, bank, account, limit):
+        """Create a new credit card instance"""
+        
+        self.customer=customer
+        self.bank= bank
+        self.account=account
+        self.limit= limit
+        self.balance=0
+
+    def getCustomer(self):
+        return self.customer
+        
+    def get_bank(self):
+        return self.bank
+        
+    def get_account(self):
+        return self.account
+        
+    def get_limit(self):
+        return self.limit
+        
+    def get_balance(self):
+        return self.balance
+    
+    def charge(self, price):
+        """Charge given price to the card, assuming sufficient credit limit"""
+        if price+self.balance > self.limit:
+            return False
+        else:
+            self.balance+= price
+            return True
+        
+    def make_payment(self, amount):
+        """Process customer payment that reduces balance"""
+        self.balance-=amount
+        
+    

PythonDataStructsAndAlgo/Recursion/BinarySearch.py

@@ -0,0 +1,28 @@
+def binarySerch(list, number, low, high) -> int:
+    
+    #Non recursive way
+    # low=0
+    # high=len(list)
+    # while low < high:
+    #     mid=int((low+high)/2)
+    #     if number > list[mid]:
+    #         low=mid
+    #     elif number == list[mid]:
+    #         return mid 
+    #     else:
+    #         high=mid
+
+    if low >high:
+        return 0
+    else:
+        mid=(low+high)//2
+        if number == list[mid]:
+            return mid
+        elif number > list[mid]:
+            return binarySerch(list, number, mid+1, high)
+        else:
+            return binarySerch(list, number, low, mid-1)
+
+list=[2,4,7,18, 45,56,130]
+answer= binarySerch(list, 45, 0, len(list))
+print(answer)