Post Optimize Bubble Sort

Bubble sort requires is O(N²) time in non optimize state, but we can optimize it to be at O(N²)/2 by reducing the number of iteration needed. Here is python code sample:

def bubble_sort(arr):
iteration_count = 0
for i in range(len(arr)):
for idx in range(len(arr) - i - 1):
iteration_count += 1
if arr[idx] > arr[idx + 1]:
arr[idx], arr[idx + 1] = arr[idx + 1], arr[idx]