Day13

Author: mahtab04

Day13/q46.py

@@ -0,0 +1,14 @@
+# Implement the Linear search
+
+__author__ = "Mahtab Alam"
+
+def Linear_Search(alist, item):
+    for i in range(len(alist)):
+        if alist[i] == item:
+            return True
+    return False
+
+
+l = [23, 4, 5, 1, 2, 3]
+
+print(Linear_Search(l, 10))

Day13/q47.py

@@ -0,0 +1,25 @@
+# implemet Binary Search Algorithm
+
+# Note For binary serch Array must be sorted
+
+__author__ = "Mahtab Alam"
+
+
+def bianry_search(alist, item):
+    """Binary Search Algorithm"""
+    first = 0
+    last = len(alist)-1
+    found = False
+    while first <= last and not found:
+        mid = (first+last)//2
+        if alist[mid] == item:
+            found = True
+        else:
+            if item < alist[mid]:
+                last = mid-1
+            else:
+                first = mid+1
+    return found
+
+
+print(bianry_search([4, 5, 6, 7, 8, 9], 4))

Day13/q48.py

@@ -0,0 +1,21 @@
+
+
+# Problem Link https://www.hackerrank.com/challenges/swap-case/problem
+
+
+__author__ = "Mahtab Alam"
+
+
+def swap_case(s):
+    a = ""
+    for word in s:
+        if word.isupper() == True:
+            a += (word.lower())
+        else:
+            a += (word.upper())
+    return a
+
+
+s = "Www.HackerRank.com"
+
+print(swap_case(s))