Practice

Author: mahtab04

Day11/names.txt

@@ -0,0 +1,100 @@
+Darth
+Luke
+Darth
+Lea
+Darth
+Lea
+Lea
+Luke
+Darth
+Lea
+Darth
+Darth
+Lea
+Lea
+Darth
+Lea
+Darth
+Lea
+Luke
+Darth
+Lea
+Lea
+Darth
+Lea
+Darth
+Darth
+Lea
+Lea
+Luke
+Luke
+Lea
+Darth
+Darth
+Luke
+Lea
+Darth
+Darth
+Lea
+Lea
+Lea
+Lea
+Lea
+Luke
+Darth
+Luke
+Lea
+Lea
+Lea
+Lea
+Luke
+Lea
+Darth
+Lea
+Lea
+Darth
+Lea
+Lea
+Darth
+Darth
+Lea
+Darth
+Lea
+Darth
+Luke
+Lea
+Luke
+Darth
+Darth
+Luke
+Darth
+Lea
+Darth
+Lea
+Luke
+Lea
+Lea
+Lea
+Lea
+Lea
+Darth
+Lea
+Lea
+Lea
+Lea
+Lea
+Lea
+Lea
+Luke
+Lea
+Lea
+Lea
+Lea
+Lea
+Lea
+Darth
+Luke
+Darth
+Lea
+Lea
+Darth

Day11/q40.py

@@ -0,0 +1,22 @@
+# Python program to find power of a number
+
+
+class Power:
+    def pow(self, x, n):
+        if x == 0 or x == 1 or n == 1:
+            return 1
+        if x == -1:
+            if n % 2 == 0:
+                return 1
+            else:
+                return -1
+        if n == 0:
+            return 1
+        if n < 0:
+            return 1/self.pow(x, -n)
+        val = self.pow(x, n/2)
+        if n % 2 == 0:
+            return val * val
+        return val*val*x
+
+print(Power().pow(2,-3))

Day11/q41.py

@@ -0,0 +1,26 @@
+# Write a function that takes an ordered list of numbers
+# (a list where the elements are in order from smallest to
+# largest) and another number. The function decides whether
+# or not the given number is inside the list and returns
+# (then prints) an appropriate boolean.
+
+
+def Search(alist, item):
+    first = 0
+    last = len(alist)-1
+    found = False
+    while first <= last and not found:
+        midpoint = (first + last)//2
+        if alist[midpoint] == item:
+            found = True
+        else:
+            if item < alist[midpoint]:
+                last = midpoint-1
+            else:
+                first = midpoint+1
+    return found
+
+
+t = [0, 1, 2, 8, 13, 17, 19, 32, 42, ]
+print(Search(t, 3))
+print(Search(t, 13))

Day11/q42.py

@@ -0,0 +1,10 @@
+# Given a .txt file that has a list of a bunch of names, count 
+# how many of each name there are in the file, and print out 
+# the results to the screen.
+
+count =0
+with open('Day11\\names.txt','r') as f:
+    line = f.readlines()
+    for l in line:
+        count += 1
+    print(count)