Hey, Ninjas! Do you need clarification about the difference between sort and sorted in Python? Whether new to coding or experienced, this article will explain sort and sorted functions in Python that help sort data. By the end of this article, you'll understand how these functions work differently.

Let's explore the difference between sort and sorted functions in Python together!

Sorting in Python

Sorting in Python is a way to arrange things in a specific order. You can organize the data in ascending or descending order according to your need. Sorting is very helpful when finding particular items in your data. There are two ways to sort your data using a built-in function in Python:

sort() function

sorted() function.

Here is an example of sorting a list of numbers in ascending order.

CODE

Python

Python

numbers = [3, 6, 1, 8, 2, 9, 5] sorted_numbers = [] while numbers: minimum = numbers[0] # Set the first element as the current minimum for x in numbers: #If any element is smaller than the current minimum, then update the minimum if x < minimum: minimum = x # Add minimum to the sorted_numbers list sorted_numbers.append(minimum) # remove minimum from the numbers list numbers.remove(minimum) print(sorted_numbers)

OUTPUT

EXPLANATION

In this example, the list numbers are sorted by finding the minimum value in the list and appending it to a new list sorted_numbers until no more values are left in the numbers. The remove() method removes the minimum value from numbers after it has been added to sorted_numbers.

The most efficient way to sort a list in Python is by using built-in sorting functions such as Sorted or Sort.

Get the tech career you deserve, faster!

Connect with our expert counsellors to understand how to hack your way to success

User rating 4.7/5

1:1 doubt support

95% placement record

Akash Pal

Senior Software Engineer

326% Hike After Job Bootcamp

Himanshu Gusain

Programmer Analyst

32 LPA After Job Bootcamp

After Job Bootcamp

Sort() Function in Python

The sort() method in Python can sort a list of elements in a specific order. By default, this function sorts elements in ascending order. You can also use parameters to sort items in a different order according to your requirements, like from largest to smallest. The sort() function modifies the existing input list and does not return a new one.

The sort() function compares the first two elements of the list and swaps them if they are not in order. It then compares the next element with the first element, switches them if necessary, and moves on to the next element until the entire input list is sorted.

Syntax

list_name.sort(reverse=False, key=None)

Here are some examples of using the sort() function in Python:

Example 1: Sorting a list of integers in ascending order

Call sort() on the list of integers and the list will be sorted in place.

The sorted list will be in ascending order. If you want to sort the list in descending order, pass the reverse=True argument.

Example 3: Sorting a list of tuples based on the second element

Use a lambda function as the key parameter, using each tuple's second element as the sorting criterion. Based on the second element of each tuple, the sorted output list will be printed in ascending order.

Example 4: Sorting a list of custom objects based on a specific property

Use a lambda function as the key parameter, with the specific property of the custom object as the sorting criteria. Based on the particular property of the custom object, the sorted output list will be printed in ascending order.

CODE

Python

Python

class Student: def __init__(self, name, marks): self.name = name self.marks = marks def __repr__(self): return f"{self.name}: {self.marks}" students = [Student('Ram', 80), Student('Shyam', 90), Student('Sita', 75), Student('Gita', 85)] def get_marks(student): return student.marks students.sort(key=get_marks) print(students)

OUTPUT

Time Complexity

O(nlog(n)) : The time complexity of sort() function in Python is O(n log n) on average, and in the worst case, where n is the number of elements in the list to be sorted. This is because sort() use the timsort algorithm, which has this time complexity.

Space Complexity

O(n) : The sort() method only uses additional space when performing a timsort, and in the worst case, it requires O(n) space, where n is the number of elements in the list.

Sorted() Function in Python

The sorted function is used to sort a list of elements in ascending or descending order. It takes an iterable object (a list or tuple) as input and returns a new sorted list. By default, the sorted function sorts elements in ascending order, but you can specify the reverse=True argument to sort in descending order according to your need. Be careful when sorting vast input, as very long lists can be relatively slow.

Syntax

sorted(iterable, key=None, reverse=False)

Here are some examples of using the sorted() function in Python:

Example 1: Sorting a list of numbers in ascending order

Call the sorted() function and pass the list as an argument. The output sorted list will be in ascending order.

Example 3: Sorting a list of tuples based on the second element of each tuple

Use a lambda function as the key parameter for sorted(), with the second element of each tuple as the sorting criteria. The sorted list will be in ascending order based on the second element of each tuple.

Here are some tips for using the sort() and sorted() functions in Python:

Consider using built-in functions like min() and max() instead of sort() or sorted() when you only need to find the smallest or largest value in a list.

Always use sort() for in-place sorting.

Consider using another sorting algorithm like merge or heap sort for large datasets.

While sorting strings, be aware of the case sensitivity of the sort and consider using the key parameter with the str. lower() method.

If you need to sort a list of objects based on their properties, consider implementing the lt() method or using the key parameter with a lambda function.

Always use explicit variable and function names to make your sorting code more readable and maintainable.

As of now, you might have gotten the idea of the difference between sort and sorted in Python. Now we move into the FAQ section. Must Read C Program to Reverse a Number

Frequently Asked Questions

Is sort faster than sorted Python?

sort() is generally faster than sorted() in Python because it sorts the list in-place by modifying the original list. On the other hand, sorted returns a new sorted list while preserving the original list.

Does sort () in Python use extra space?

No, the sort() method in Python does not use extra space. It sorts the list in-place, rearranging the existing elements, which means it does not create a new copy of the list or use additional memory.

How many types of sort are there in Python?

Python offers various sorting algorithms, including Timsort (used by sorted() and sort()), QuickSort, MergeSort, BubbleSort, and more. However, Timsort is the most commonly used sorting algorithm in Python's standard library.

Is Python sort () stable?

Yes, Python's sort() method is stable. This means that when sorting elements with equal values, the relative order of those elements will be preserved after sorting, ensuring consistent behavior for sorting algorithms.

Conclusion

In conclusion, the sort and sorted functions are used for sorting lists in Python. Understanding the differences between sort and sorted in Python is essential. While both functions sort a list, their implementation has some differences. Understanding the difference between sort and sorted in Python can help you effectively manipulate lists in your Python programs.

If you want to learn more about this topic and go into more detail, we recommend reading the articles attached.