mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-10-06 05:39:30 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix: use += in sorts/recursive_mergesort_array.py (#5019)

Browse Source
This commit is contained in:
Connor Bottum 2021-10-26 12:43:46 -04:00 committed by GitHub
parent cb4dc19723
commit 31061aacf2
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
sorts/recursive_mergesort_array.py
View File

@ -38,23 +38,23 @@ def merge(arr: list[int]) -> list[int]:
): # Runs until the lowers size of the left and right are sorted. ): # Runs until the lowers size of the left and right are sorted.
if left_array[left_index] < right_array[right_index]: if left_array[left_index] < right_array[right_index]:
arr[index] = left_array[left_index] arr[index] = left_array[left_index]
left_index = left_index + 1 left_index += 1
else: else:
arr[index] = right_array[right_index] arr[index] = right_array[right_index]
right_index = right_index + 1 right_index += 1
index = index + 1 index += 1
while ( while (
left_index < left_size left_index < left_size
): # Adds the left over elements in the left half of the array ): # Adds the left over elements in the left half of the array
arr[index] = left_array[left_index] arr[index] = left_array[left_index]
left_index = left_index + 1 left_index += 1
index = index + 1 index += 1
while ( while (
right_index < right_size right_index < right_size
): # Adds the left over elements in the right half of the array ): # Adds the left over elements in the right half of the array
arr[index] = right_array[right_index] arr[index] = right_array[right_index]
right_index = right_index + 1 right_index += 1
index = index + 1 index += 1
return arr return arr