Bubble Sort adaptation. Rewrite the following bubblesort algorithm so that in each pass, it bubbles down...

 

Transcribed Image Text:

Bubble Sort adaptation. Rewrite the following bubblesort algorithm so that in each pass, it bubbles down the smallest element to the left end. //Bubble sort given list into ascending order BubbleSort (a [0...n-1) //right points to the last element of the "remaining list" //it starts from n-1, after each pass, it decreases by 1 for right-n-1 downto 1: //perform one bubbling pass, bubbling up the largest element to right end for i=0 to right-1: if (a[i]>a[i+1]): swap (a[i], a[i+1]) Activate Windows Bubble Sort adaptation. Rewrite the following bubblesort algorithm so that in each pass, it bubbles down the smallest element to the left end. //Bubble sort given list into ascending order BubbleSort (a [0...n-1) //right points to the last element of the "remaining list" //it starts from n-1, after each pass, it decreases by 1 for right-n-1 downto 1: //perform one bubbling pass, bubbling up the largest element to right end for i=0 to right-1: if (a[i]>a[i+1]): swap (a[i], a[i+1]) Activate Windows

Answer rating: 100% (QA)

To adapt the bubble sort algorithm so that it bubbles down the smallest ele... View the full answer