FAQ: Radix Sort: Python - Setting Up For Sorting

This community-built FAQ covers the “Setting Up For Sorting” exercise from the lesson “Radix Sort: Python”.

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

Sorting Algorithms

FAQs on the exercise Setting Up For Sorting

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!

What is the difference between, new_list = old_list and new_list = old_list[:] ? Isn’t both the same?

1 Like

No, they are not the same. In your first example, new_list is a reference only to the old_list. They are not discrete lists. Any change directed at one will be visible to the other.

In the second example, old_list[:] is the near equivalent of old_list.copy() so that both lists are now discrete and independent of one another. Now we can mutate either list without affecting the other.

1 Like

This is great!! Thanks as always…

2 Likes