Implement bubble sort—another simple yet inefficient sorting technique. It’s called bubble sort or sinking sort because smaller values gradually “bubble” their way to the top of the array (i.e., towards the first element) like air bubbles rising in water, while the larger values sink to the bottom (end) of the array. The technique uses nested loops to make several passes through the array. Each pass compares successive pairs of elements. If a pair is in increasing order (or the values are equal), the bubble sort leaves the values as they are. If a pair is in decreasing order, the bubble sort swaps their values in the array. The first pass compares the first two elements of the array and swaps their values if necessary. It then compares the second and third elements in the array. The end o

Question

What will be an ideal response?

Answer 1

Bubble sort contains two nested for loops. The outer for loop (lines 24–33) iterates over data.length - 1 passes. The inner for loop (lines 27–32) iterates over da- ta.length - 1 elements in the array. When loops are nested, the respective orders are multiplied. This is because for each of O(n) iterations of the outside loop, there are O(n) iterations of the inner loop. This results in a total Big O of O(n2).