sorting algorithms in python code example

Example 1: python bubble sort

def bubbleSort(arr): 
    n = len(arr) 
  
    # Traverse through all array elements 
    for i in range(n-1): 
    # range(n) also work but outer loop will repeat one time more than needed. 
  
        # Last i elements are already in place 
        for j in range(0, n-i-1): 
  
            # traverse the array from 0 to n-i-1 
            # Swap if the element found is greater 
            # than the next element 
            if arr[j] > arr[j+1] : 
                arr[j], arr[j+1] = arr[j+1], arr[j] 
  
# Driver code to test above 
arr = [64, 34, 25, 12, 22, 11, 90] 
  
bubbleSort(arr)

Example 2: python sort algorithm

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

Example 3: sorting algorithms in python

9 Sorting Algorithms implementation in Python at this link:
  
https://github.com/shreyasvedpathak/Data-Structure-Python/tree/master/Sorting%20Algorithms

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

Example 5: sorting in python

python list sort()