Python

Algo and data structs in python

Author: Blooverh

PythonDataStructsAndAlgo/Chapter1/1_1.py

@@ -0,0 +1,8 @@
+def is_multiple(n,m):
+    i=2
+    if n == m*i:
+        return True
+    else: 
+        return False
+    
+print(is_multiple(3,2))

PythonDataStructsAndAlgo/Chapter1/1_2.py

@@ -0,0 +1,23 @@
+# def is_even(k):
+#     if (k % 2) == 0:
+#         return True
+#     else:
+#         return False
+    
+# k=int(input("What number you want to check? "))
+# print(f"Is {k} an even number")
+# answer= is_even(k)
+# print(answer)
+
+"""Without using mathematical operators"""
+def isEven(k):
+    evenList=[]
+    for num in range(2,1000,2):
+        evenList.append(num)
+
+    if k in evenList:
+        return True
+    else:
+        return False
+
+print(isEven(6))

PythonDataStructsAndAlgo/Chapter1/1_3.py

@@ -0,0 +1,18 @@
+"""This algorithm runs at O(n)"""
+def minmax(data):
+    min=data[0]
+
+    for num in range(1,len(data)):
+        if data[num] <= min:
+            min=data[num]
+    
+    max= data[0]
+    for num in range(1, len(data)):
+        if data[num] >= max:
+            max=data[num]
+    
+    return min, max
+
+data=[2,3,1,6,5,8,4,9]
+print(minmax(data))
+

PythonDataStructsAndAlgo/Chapter1/1_4.py

@@ -0,0 +1,25 @@
+def sumOfSquares(k):
+    num=0
+    sum=0
+    list=[]
+    while num < k:
+        list.append(num)
+        sum+=pow(num,2)
+        num=num+1
+        
+    print(list)
+    
+    return sum
+
+print(sumOfSquares(5))
+
+def sum_of_sq(n):
+
+    list_tot=[]
+    for i in range(1,n):
+        list_tot.append(i*i)
+    
+    print(list_tot)
+    return sum(list_tot)
+
+print(sum_of_sq(5))

PythonDataStructsAndAlgo/Chapter1/1_5.py

@@ -0,0 +1,10 @@
+def listOfsquares(k):
+    list=[]
+
+    for num in range(k):
+        list.append(pow(num,2))
+    
+    print(list)
+    print(sum(list))
+
+listOfsquares(5)

PythonDataStructsAndAlgo/Chapter1/NotesChpt1.md

@@ -0,0 +1,14 @@
+# Set and frozeset classes in python
+
+    -> set class represents the mathematical notion of a set, namely a collection of elements without duplicates, and without an inherent order to those elements.
+
+    -> Major advantage of a set vs a list is that it  has highly optimized method for checking whether a specific element is contained in the set.
+        This based on the data structure names Hash Table.
+    
+    -> Major disadvantages: 
+        1. set does not maintain the elements in any particular order. 
+        2. only instances of immutable types can be added to a python set.
+
+    -> It is possible to maintain a set of tuples, but not a set of lists or a set of sets because lists and sets are mutable and tuples are not.
+
+    -> Frozen set class is an immutable form  of the set type, so it is legal to have a set of frozen sets