Bitwise Algorithm and Linear Search updated

algorithms/bit manipulation/twice_unique.py

@@ -0,0 +1,11 @@
+def twice_unique(arr:list) :
+    unique = 0
+    for i in arr:
+        unique ^= i
+    return unique
+if __name__=="__main__":
+    array = list(map(int,input().split()))
+    #sample input 
+    # 1 2 2 3 4 4 3
+    element = twice_unique(array)
+    print(f"Unique element in the array {array} is {element}")

algorithms/bit manipulation/xor_swap.py

@@ -0,0 +1,11 @@
+def swap(a:int,b:int) -> list :
+    a=a^b
+    b=b^a
+    a=a^b
+    return [a,b]
+
+if __name__=="__main__":
+    a=int(input("Enter Number 1 : "))
+    b = int(input("Enter Number 2 : "))
+    AfterSwap= swap(a,b)
+    print(f"After Swap : {AfterSwap[0],AfterSwap[1]}")

algorithms/searches/linear_search.py

@@ -10,4 +10,4 @@ def linear_search(arr, item):
 
 # Tests
 
-print(search([1,2,3,4,5], 3))
+print(linear_search([1,2,3,4,5], 3))