bubble sort len)arr)-i-1 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: bubble sort in python

def bubble_sort(arr):
    x=-1
    n=len(arr)#length of array 6
    for i in range (0,n):
        for j in range(1,n-i):
            if arr[j-1]>arr[j]:
                arr[j-1],arr[j]=arr[j],arr[j-1]
        if (n-i)<=1:
            break
    return arr
            
if "__main__"==__name__:
    arr=[7,1,2,6,9,3,8,4]
    result=bubble_sort(arr)
    print(result)