Bubble_Sort_251701105.py

# BUBBLE SORT-251701105
def bubbleSort(arr,n):
    #n = len(arr)
 
    # Traverse through all array elements
    for i in range(n):
 
        # 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 =[]
n = int(input("Enter number of elements"))
for k in range(n):
    arr.append(n)
 
bubbleSort(arr,len(arr))
 
print ("Sorted array is:")
for i in range(len(arr)):
    print ("%d" %arr[i])