Consider the following list of integer indexed from 1 to 8 (i.e intList[1]-35....., intList[8]-38) intList]- (35,...

Transcribed Image Text:

Consider the following list of integer indexed from 1 to 8 (i.e intList[1]-35....., intList[8]-38) intList]- (35, 12, 27, 5, 18, 45, 16, 38) Consider the following pseudo code version of Bubble Sort (n=8) for j=1 to n-1 do for i=1 to n-1 do if intList[i]> intList[i+1] swap (intList[i], intList[i+1]) What is the position (index) of element 38 after the first pass? O a. 2 O b. none of the above Oc7 O d.8 Consider the following list of integer indexed from 1 to 8 (i.e intList[1]-35....., intList[8]-38) intList]- (35, 12, 27, 5, 18, 45, 16, 38) Consider the following pseudo code version of Bubble Sort (n=8) for j=1 to n-1 do for i=1 to n-1 do if intList[i]> intList[i+1] swap (intList[i], intList[i+1]) What is the position (index) of element 38 after the first pass? O a. 2 O b. none of the above Oc7 O d.8

Answer rating: 100% (QA)

In the first pass of the Bubble Sort algorithm the algori... View the full answer