A variety of sorting algorithms are available for use with Python arrays, with the runtime and efficiency of the algorithms varying depending on which algorithm is selected. A few of these approaches to sorting array elements are investigated in this article.

## Using Sorted() Function To Sort Array In Python

In order to perform sorting, Python makes use of some incredibly fast algorithms. Python An algorithm called Timsort (a combination of Merge Sort and Insertion Sort) is used by the sorted() method to perform highly optimized sorting. As long as the object can be iterated over, this method can be used to sort it.

#importing Require Library import array # Declare an List of Number numberList = [6,4,1,2,3,5] # Declare an Array Object To Hold List of Integer numArrrayObj = array.array('i', [12,11,15,13,10]) print('Sorted List Of Numbers = ', sorted(numberList)) print('Sorted Array Of Numbers = ', sorted(numArrrayObj))

**Output:**

```
Sorted List Of Numbers = [1, 2, 3, 4, 5, 6]
Sorted Array Of Numbers = [10, 11, 12, 13, 15]
```

- As you can see in the above code example, I was able to sort an array and a list of integers using a common function called sorted.
- Python function sorted() uses the most optimized sorting algorithm which is a combination of quick sort and merge sort.
- This combination provides a guaranteed
**O(**runtime for both worst and best runtime.*nlogn*)

## Wrap Up

I hope you now understand how to sort an array in Python using inbuilt functions like sorted(), which are based on a combination of the **merge sort** and **quick sort algorithms**.

Please let me know if you have any problems with the array sorting algorithm in the comments section. I would be delighted to assist you as soon as possible.

**Further Read:**