Revision history [back]

A possible way to merge two sorted arrays in Python is to use a two-pointer approach, where we iterate over both arrays in parallel, comparing the values at each index and inserting the smaller value into a new array. Here's an example implementation:

def merge_sorted_arrays(arr1, arr2):
    # initialize pointers for both arrays
    i = 0
    j = 0
    merged = []

    # compare the values at the current indices and add the smaller
    # value to the merged array, advancing the corresponding pointer
    while i < len(arr1) and j < len(arr2):
        if arr1[i] < arr2[j]:
            merged.append(arr1[i])
            i += 1
        else:
            merged.append(arr2[j])
            j += 1

    # add any remaining values from the first array
    while i < len(arr1):
        merged.append(arr1[i])
        i += 1

    # add any remaining values from the second array
    while j < len(arr2):
        merged.append(arr2[j])
        j += 1

    return merged

This implementation has a time complexity of O(n), where n is the total number of elements in the two arrays.