human
What is a code to bubble Sort and the other steps required given the following:
Bubble Sort | An optimized version of Bubble Sort.
traverse the array from 0 to n - i - 1. Swap if the element found is greater than the next element.
IF no two elements were swapped by inner loop , then break.
Driver code to test above"
How can the above be solved in Python?
assistant
#Here is code to bubble Sort and the other steps required.
 def bubbleSort ( arr ) :
	n = len ( arr )
	for i in range ( n ) :
		swapped = False
		for j in range ( 0 , n - i - 1 ) :
			if arr [ j ] > arr [ j + 1 ] :
				arr [ j ] , arr [ j + 1 ] = arr [ j + 1 ] , arr [ j ]
				swapped = True
		if swapped == False :
			break
arr = [ 64 , 34 , 25 , 12 , 22 , 11 , 90 ]
bubbleSort ( arr )
print ( " Sorted ▁ array ▁ : " )
for i in range ( len ( arr ) ) :
	print ( " % d " % arr [ i ] , end = " ▁ " )