My merge sort implementation in Python failed

[nexoa-pro]

My merge sort implementation in Python is failing on large arrays. Getting 'index out of range' error during merge step. How to fix?

[MaxValueBuilder]

This is a classic off-by-one error in the merge function. Here's the corrected implementation:

def merge(left, right):
    result = []
    i = j = 0
    
    # Merge while both arrays have elements
    while i < len(left) and j < len(right):
        if left[i] <= right[j]:
            result.append(left[i])
            i += 1
        else:
            result.append(right[j])
            j += 1
    
    # Add remaining elements
    result.extend(left[i:])
    result.extend(right[j:])
    return result

def merge_sort(arr):
    if len(arr) <= 1:
        return arr
    
    mid = len(arr) // 2
    left = merge_sort(arr[:mid])
    right = merge_sort(arr[mid:])
    
    return merge(left, right)

[nexoa-pro]

Thanks @MaxValueBuilder

[Ziceros]

Stop. Le lun. 26 janv. 2026, 09:38, nexoa-pro ***@***.***> a écrit :

…

Thanks @MaxValueBuilder <https://github.com/MaxValueBuilder> — Reply to this email directly, view it on GitHub <#14213 (reply in thread)>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/BMKMXXY2AOQP2C6LURQVNGT4IXOANAVCNFSM6AAAAACS4JJZTCVHI2DSMVQWIX3LMV43URDJONRXK43TNFXW4Q3PNVWWK3TUHMYTKNRQGQYTSNI> . You are receiving this because you are subscribed to this thread.Message ID: ***@***.*** com>