Question
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
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 Input: list a[0...n-1],
Trace the execution of your adapted bubble sort (in Q3) on the following input. Minimally, draw the content of list a after each iteration of the outer-loop.
a=[5,3,10,4,2,1] n=5
n: the length of list a Output: list a is rearranged into ascending order BubbleSort (a, n) {
//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:
2
}
//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])
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started