Small fixes

prabhupant · prabhupant · commit ef23195057a1 · 2024-04-02T15:49:12.000+05:30
diff --git a/data_structures/array/peak_element.py b/data_structures/array/peak_element.py
@@ -6,8 +6,7 @@ def peak(arr, low, high):
     n = len(arr)
 
     while low <= high:
-        mid = low + (high - low) / 2
-        mid = int(mid)
+        mid = (high - low) // 2
         
         if (mid == 0 or arr[mid-1] <= arr[mid]) and (mid == n-1 or arr[mid+1] <= arr[mid]):
             return(arr[mid])
diff --git a/data_structures/array/square_of_sorted_array.py b/data_structures/array/square_of_sorted_array.py
@@ -1,3 +1,8 @@
+"""
+Find the square of all the numbers of a sorted array such that after finding the square of the sorted array, the
+resultant array containing the squared numbers remains sorted
+"""
+
 def square(arr):
     n = len(arr)
     j = 0
