FAQ: Merge Sort: Python - Finishing the Sort

This community-built FAQ covers the “Finishing the Sort” exercise from the lesson “Merge Sort: Python”.

Paths and Courses
This exercise can be found in the following Codecademy content:

Sorting Algorithms

FAQs on the exercise Finishing the Sort

There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply (reply) below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head here.

Looking for motivation to keep learning? Join our wider discussions.

Learn more about how to use this guide.

Found a bug? Report it!

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

While this(code below) works inside codecademy’s online ide pycharm returns an error on the : in line 6 and 7
left_sorted = [:middle_index] errors: (statement expected, found py colon) and (end of statement expected)

right_sorted =[middle_index:] errors: (statement expect, found pybracket)

I’m sure there’s a way to redefine this function but I was wondering if anyone else had this issue or if maybe I’m doing something wrong or there’s some module I would need to import to make it perform as intended. Any help welcome. I’ll keep looking for answers in the meantime. Thanks!

def merge_sort(items):

if len(items) <= 1:

return items

middle_index = len(items) // 2

left_split = items[:middle_index]

right_split = items[middle_index:]

define left_sorted and right_sorted below…

left_sorted = merge_sort(left_split)

right_sorted = merge_sort(right_split)

return merge(left_sorted, right_sorted)

def merge(left, right):

result =

while (left and right):

if left[0] < right[0]:






if left:

result += left

if right:

result += right

return result