i dont need help really but this is just a little feedback, the first part of the instruction elude to needing to merge the parts together, albeit if it happens within the acceptable code fine, but when learning python without knowing how its functioning, it leaves one to believe they need to write code to merge it separately as well as the accepted answer , if you have to do it after okay but was a little confusing with the merge code blocked like that in the first paragraph, honestly the whole first paragraph did nothing but confuse me on what i needed to do.
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
# 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 11
really, even removing it completely would help, tho if the information needs to be presented so that you know whats happening to help you learn what your doing maybe just being specific that thats what your answer does and not part of the answer, possibly label the paragraph somehow to clarify its the function of the code you are expected to use and not a step to be followed in the answer
Would this be clearer concerning the steps requested?
Inside your function, create a while loop with two conditions inside it.
The first condition checks whether the left_array_index variable value is less
than the length of the content on left_part. The second condition checks than the right_array_index variable value is less than the length of the content in right_part.
This step has the effect of comparing an element from the left_part to an element from the right_part, taking the smaller of both and merging it to the main array list.
