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

Tell us what’s happening:

Hello all! I am pretty confused about what I am missing. I’ve read other forums and failed to see why my code won’t work.

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


# User Editable Region

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

# 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/120.0.0.0 Safari/537.36

Challenge Information:

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

You should do what you did, but inside the function.

1 Like

Thank you! Minor things like that always get me!

1 Like