best sorting algorithm python code example

Example 1: python sort algorithm

a = [1, 2, 0, 8, 4, 5, 3, 7, 6]
print(a.sort())

Example 2: 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