Implement the Merge Sort Algorithm - Step 24

Curriculum Help
1

Tell us what’s happening:

I have no clue why it isnt passing, I am calling the function and have numbers as the argument?

Your code so far

def merge_sort(array):
    if len(array) <= 1:
        return
    
    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):
        if left_part[left_array_index] < right_part[right_array_index]:
            array[sorted_index] = left_part[left_array_index]
            left_array_index += 1
        else:
            array[sorted_index] = right_part[right_array_index]
            right_array_index += 1
        sorted_index += 1
    
    while left_array_index < len(left_part):
        array[sorted_index] = left_part[left_array_index]
        left_array_index += 1
        sorted_index += 1
    
    while right_array_index < len(right_part):
        array[sorted_index] = right_part[right_array_index]
        right_array_index += 1
        sorted_index += 1

if __name__ == '__main__':
    numbers = [4, 10, 6, 14, 2, 1, 8, 5]
    print('Unsorted array: ')
    merge_sort(numbers)
# User Editable Region
    
# 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/151.0.0.0 Safari/537.36

Challenge Information:

Implement the Merge Sort Algorithm - Step 24

GitHub Link: freeCodeCamp/curriculum/challenges/english/blocks/workshop-merge-sort/6569c1aeecaf95e25a3e2573.md at main · freeCodeCamp/freeCodeCamp · GitHub

2

Welcome to the forum @Speedy1233e ,

You dropped one of the print function calls in the starting code, which will cause the steps to fail.

Please reset this step and try again, being careful not to change the starting code.

Happy coding