+ ♻️ : Made Code Cleaner and easy to access!

LICENSE

@@ -1,6 +1,6 @@
 MIT License
 
-Copyright (c) 2023 Shambhavi Mishra
+Copyright (c) 2024 Shambhavi Mishra
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

gist-solutions.md → contributors/souvikchand/gist-solutions.md

@@ -1,25 +1,25 @@
-https://github.com/souvikchand/oss101-forked/blob/souvikchand-details/gist-solutions.md
-def binary_search(arr, target):
-    """
-    Perform binary search on a sorted array.
-
-    Parameters:
-    - arr (list): The sorted array to search.
-    - target: The target element to find in the array.
-
-    Returns:
-    - int: The index of the target element if found, otherwise -1.
-    """
-    low, high = 0, len(arr) - 1
-
-    while low <= high:
-        mid = (low + high) // 2
-
-        if arr[mid] == target:
-            return mid
-        elif arr[mid] < target:
-            low = mid + 1
-        else:
-            high = mid - 1
-
-    return -1
+https://github.com/souvikchand/oss101-forked/blob/souvikchand-details/gist-solutions.md
+def binary_search(arr, target):
+    """
+    Perform binary search on a sorted array.
+
+    Parameters:
+    - arr (list): The sorted array to search.
+    - target: The target element to find in the array.
+
+    Returns:
+    - int: The index of the target element if found, otherwise -1.
+    """
+    low, high = 0, len(arr) - 1
+
+    while low <= high:
+        mid = (low + high) // 2
+
+        if arr[mid] == target:
+            return mid
+        elif arr[mid] < target:
+            low = mid + 1
+        else:
+            high = mid - 1
+
+    return -1