Example 1: python sort
>>> student_tuples = [
... ('john', 'A', 15),
... ('jane', 'B', 12),
... ('dave', 'B', 10),
... ]
>>> sorted(student_tuples, key=lambda student: student[2]) # sort by age
[('dave', 'B', 10), ('jane', 'B', 12), ('john', 'A', 15)]
Example 2: sort python
>>> x = [1 ,11, 2, 3]
>>> y = sorted(x)
>>> x
[1, 11, 2, 3]
>>> y
[1, 2, 3, 11]
Example 3: sort in python'
arr = [1,4,2,7,5,6]
#sort in ascending order
arr = arr.sort()
#sort in descending order
arr = arr.sort(reverse = True)
Example 4: python sort
nums = [4,8,5,2,1]
#1 sorted() (Returns sorted list)
sorted_nums = sorted(nums)
print(sorted_nums)#[1,2,4,5,8]
print(nums)#[4,8,5,2,1]
#2 .sort() (Changes original list)
nums.sort()
print(nums)#[1,2,4,5,8]
Example 5: which sort algorithm is used by python
# The algorithm used by Python's sort() and sorted() is known as Timsort.
# This algorithm is based on Insertion sort and Merge sort.
# A stable sorting algorithm works in O(n Log n) time.
# Used in Java’s Arrays.sort() as well.
# The array is divided into blocks called Runs.
# These Runs are sorted using Insertion sort and then merged using Merge sort.
arr = [6, 2, 8, 9, 5, 3, 0, 15]
arr.sort() # Since sort() does inplace sorting and returns None
print(arr)
arr = [6, 2, 8, 9, 5, 3, 0, 15]
print(sorted(arr)) # sorted() returns the sorted array