SORTING ALGORITHMS SORTING ALGORITHM PDF LINK #Bubble Sort · The outer loop iterates through the entire array. · The inner loop compares adjacent elements and swaps them if they are out of order. · The outer loop runs n times, and each pass moves the largest element to its correct position. arr=[3,8,5,2,1] n = len(arr) print(n) for i in range(n): #traverse through all the elements # Last i elements are already sorted, no need to check them for j in range(0, n-i-1): # Swap if the element found is greater than the next element if arr[j] > arr[j+1]: ...