I keep getting stuck on the first line of the while loop where the instructions are to create a while loop that compares an element in left_part to an element in right_part , and merges the smaller element to the main array list. I don’t understand the syntax needed for comparison and then to merge the elements into an array list.
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 < len(left_part) and right < len(right_part):
left_array_index < len(left_part)
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
