Update sorts/recursive_mergesort_array.py

Co-authored-by: Maxim R. <[email protected]>

Author: benfein

sorts/recursive_mergesort_array.py

@@ -30,7 +30,7 @@ def merge(arr: list[int]) -> list[int]:
 				arr[k] = left_array[i]
 				i = i + 1
 				k = k + 1
-		while(j < right_size):
+		while j < right_size:
 				arr[k] = right_array[j]
 				j = j + 1
 				k = k + 1