Fast sorting in Python NumPy

Although Python has built-in sort and sorted functions to work with lists, we won't discuss them here because NumPy's np.sort function turns out to be much more efficient and useful for our purposes. By default np.sort uses an O[NlogN], quicksort algorithm, though mergesort and heapsort are also available. For most applications, the default quicksort is more than sufficient.

 Program

x = np.array([2, 1, 4, 3, 5]) 

np.sort(x)
 

Output:

array([1, 2, 3, 4, 5])