Wahaj-Raza
diff --git a/‎arrayReverse.py‎
Lines changed: 28 additions & 0 deletions b/‎arrayReverse.py‎
Lines changed: 28 additions & 0 deletions
diff --git a/‎binarySearch.py‎
Lines changed: 31 additions & 0 deletions b/‎binarySearch.py‎
Lines changed: 31 additions & 0 deletions
@@ -0,0 +1,28 @@
+# Simple swapping of array elements using two pointer method
+
+def reverse(arr):
+    start = 0
+    end = len(arr) - 1
+    temp = 0
+
+    while( start < end ):
+        temp=arr[start]
+        arr[start]=arr[end]
+        arr[end]=temp
+        start += 1
+        end -= 1
+
+# User input starts
+def userInput():
+    arr = []
+    n  = int(input("Enter number of elements:"))
+    print("Enter the elements")
+    for i in range(0,n):
+        element = int(input())
+        arr.append(element)
+
+    print("Array before reversing:", arr)
+    reverse(arr)
+    print("Array after reversing:", arr)
+
+userInput()
@@ -0,0 +1,31 @@
+def binarySearch(arr,target):
+    start = 0
+    end = len(arr) - 1
+
+    while ( start <= end ):
+        mid = start + ( end - start ) // 2
+        if (target < arr[mid]):
+            end = mid - 1
+        elif (target > arr[mid]):
+            start = mid + 1
+        else:
+            return mid
+    return -1
+
+def userInput():
+    arr = []
+    n  = int(input("Enter number of elements: "))
+    print("Enter the elements")
+    for i in range(0,n):
+        element = int(input())
+        arr.append(element)
+    print(arr)
+    target = int(input("Enter the target element: "))
+
+    result = binarySearch(arr,target)
+    if(result == -1):
+        print("Element not found")
+    else:
+        print("The element was found at index ", result)
+
+userInput()