Day1

Author: kunalarya873

Diff for: .DS_Store

@@ -0,0 +1,47 @@
+def multiply(n):
+    return n*n # O(1) complexity
+print(multiply(9))
+
+def print_items(n):
+    for i in range(n):
+        print(i)#O(n) time Complexity
+print_items(10)
+
+def print_item(n):
+    for i in range(n):
+        for j in range(i):
+            print(i, j) # 0(n^2) time Complexity Because of Nested Loop
+
+def printItem(n):
+    for i in range(n):
+        for j in range(j):
+            for k in range(j):
+                print(i, j, k) # O(n^3) time complexity 
+def dropNonDominantOperation(n):
+    for i in range(n):
+        for j in range(i):
+            print(i, j)
+    for k in range(n):
+        print(k)
+        # O(n^2+n) is equal to O(n^2)
+
+def sum1(n):
+    if n<=0: #Space Complexity
+        return 0
+    return n + sum1(n-1)
+print(sum1(3))
+
+def pair_sum_sequence(n):#Space Complexity
+    total = 0
+    for i in range(n):
+        total = total + pair_sum(i, i+1)
+    return total
+def pair_sum(a, b):
+    return a+b
+
+def findBiggestNumber(sampleArray):
+    biggestNum= sampleArray[0]
+    for index in range(1, len(sampleArray)):
+        if sampleArray[index] > biggestNum:
+            biggestNum = sampleArray[index]
+        print(biggestNum)

Diff for: BigO.py

@@ -0,0 +1,130 @@
+#  Created by Elshad Karimov on 3/17/20.
+#  Copyright © 2020 Elshad Karimov. All rights reserved.
+
+
+array = [1, 2, 3, 4, 5]
+
+######  Constant time complexity  #######
+print('######  Constant time complexity  #######')
+print(array[0])
+
+
+######  Linear time complexity  #######
+print('######  Linear time complexity  #######')
+for element in array:
+     print(element)
+
+
+######  Logarithmic time complexity  #######
+print('######  Logarithmic time complexity  #######')
+for index in range(0,len(array),3):
+     print(array[index])
+
+
+######  Quadratic time complexity  #######
+print('######  Quadratic time complexity  #######')
+for x in array:
+    for y in array:
+         print(x,y)
+
+
+######  Exponential time complexity  #######
+print('######  Exponential time complexity  #######')
+def fibonacci(n):
+    if n <= 1:
+        return n
+    return fibonacci(n-1) + fibonacci(n-2)
+
+
+######  Add vs Multiply ####### 
+arrayA = [1,2,3,4,5,6,7,8,9]
+arrayB = [11,12,13,14,15,16,17,18,19] 
+
+for a in arrayA:
+    print(a)
+
+for b in arrayB:
+    print(b)
+
+for a in arrayA:
+    for b in arrayB:
+        print(a,b)
+
+######  Iterative algorithm - finding the biggest number in the array ####### 
+
+sample1Array = [1,10,45,33,23,45,67,2,3,33,55,11,65,76,34,35,27,99]
+
+def findBiggestNumber(sampleArray):
+    biggestNumber = sampleArray[0]
+    for index in range(1,len(sampleArray)):
+        if sampleArray[index] > biggestNumber:
+            biggestNumber = sampleArray[index]
+    print(biggestNumber)
+
+findBiggestNumber(sample1Array)
+
+######  Recursive algorithm - finding the biggest number in the array ####### 
+
+def findMaxNumRec(sampleArray, n):
+    if n == 1:
+       return sampleArray[0]
+    return max(sampleArray[n-1],findMaxNumRec(sampleArray,n-1))
+
+print(findMaxNumRec(sample1Array,len(sample1Array)))
+
+
+######  Recursive algorithm multiple calls ####### 
+
+def f(n):
+    if n <= 1:
+        return 1
+    return f(n-1) + f(n-1)
+
+print(f(3))
+
+
+
+
+
+
+
+######  Quiz Questions ####### 
+
+
+def f1(n):
+    if n <= 0:
+        return 1
+    else:
+        return 1 + f1(n-1)
+
+
+def f2(n):
+    
+    if n <= 0:
+        return 1
+    else:
+        return 1 + f2(n-5)
+
+
+def f3(n):
+    if n <= 0:
+        return 1
+    else:
+        return 1 + f3(n/5)
+
+
+def f4(n,m,o):
+    if n<=0:
+        print(n,m,o)
+    else:
+        f4(n-1,m+1,o)
+        f4(n-1,m,o+1)
+
+def f5(n):
+    for i in range(0,n,2):
+        print(i)  
+    if n<=0:
+        return 1
+    else:
+        return 1 + f5(n-5)
+

Diff for: BigO/BigO.py

@@ -0,0 +1,5 @@
+def sum1(n):
+    if n<=0:
+        return 0
+    return n+ sum(n-1)
+sum1(3)