FAQ: Quicksort: Python - Partitioning Party

This community-built FAQ covers the “Partitioning Party” exercise from the lesson “Quicksort: Python”.

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

Sorting Algorithms

FAQs on the exercise Partitioning Party

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!

In the example, when the first element is compared to the pivot value; if the value was lesser than the pivot, would that result in swapping the first element with the pivot element? since all the other lesser than swaps were with the element designated by the lesser than pointer.

Thanks for your help

There is a bug:
This doesn’t pass on task 4:

list[pivot_element], list[lesser_than_pointer] = list[lesser_than_pointer], list[pivot_element]

I followed the instructions correctly but it asks me to use end instead of pivot_element so that I can pass. I the instructions are wrong.

3 Likes