Computer Science - Algorithms - Bubble sort - Bubble Sort Algorithm

4 steps. Step 1 'How It Works': Compare adjacent pairs. If left > right, swap them. After one full pass, largest element is at the end ('bubbled up'). Repeat for remaining unsorted portion. Step 2 'Code': def bubble_sort(arr): n = len(arr); for i in range(n-1): for j in range(n-1-i): if arr[j] > arr