Learn Data Structures by Building the Merge Sort Algorithm - Step 15

just more feedback… but again whats up with the instructions on these, the middle part of the instructions seems to indicate i need to do more than i actually have to do and is nothing but making the whole thing harder than it has to be

Your code so far

def merge_sort(array):
    
    middle_point = len(array) // 2
    left_part = array[:middle_point]
    right_part = array[middle_point:]

    merge_sort(left_part)
    merge_sort(right_part)

    left_array_index = 0
    right_array_index = 0
    sorted_index = 0

    while left_array_index < len(left_part) and right_array_index < len(right_part):

# User Editable Region

        if left_part[left_array_index] < right_part[right_array_index]:
            array[sorted_index] = left_part[left_array_index]
            left_array_index += 1

# User Editable Region

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/122.0.0.0 Safari/537.36

Challenge Information:

Learn Data Structures by Building the Merge Sort Algorithm - Step 15

If you have an example of how to better introduce the lesson it could be implemented in a future update. Any specific suggestions?