Consider the following array. Sort the given values in the array using the bubble sort technique.

Question

Accepted Answer

In the given array, the number of elements in the array is 5, so the number of iterations will be (n – 1) = 4.

Pass 1 –

a) 40 and 50 are compared. Since 40 < 50, no swapping is done.

b) 50 and 20 are compared. Since 50> 20, swapping will be done.

c) 50 and 90 are compared. Since 50 < 90, no swapping is done.

d) 90 and 30 are compared. Since 90 > 30, swapping is done.

At the end of the first pass, the largest element in the array is placed at the highest position in the array, but all the other elements are still unsorted. Let us now proceed to Pass 2.

Pass 2 –

a) 40 and 20 are compared. Since 40 > 20, swapping is done.

b) 40 and 50 are compared. Since 40 < 50, no swapping will be done.

c) 50 and 30 are compared. Since 50 > 30, swapping is done.

At the end of the second pass, the second largest element in the array is placed at the second last position in the array, but all the other elements are still unsorted. Let us now proceed to Pass 3.

Pass 3 –

a) 20 and 40 are compared. Since 20 < 40, no swapping is done.

b) 40 and 30 are compared. Since 40 > 30, swapping will be done.

At the end of the third pass, the third largest element in the array is placed at the third largest position in the array, but all the other elements are still unsorted. Let us now proceed to Pass 4.

Pass 4 –

a) 20 and 40 are compared. Since 20 < 40, no swapping is done.
At the end of the fourth pass, we can see that all the elements in the list are sorted. Hence, after sorting the new array will be:

Question 6.7: Consider the following array. Sort the given values in the a...

Related Answered Questions

Sort the values given in the array using the quick sort algorithm. ...

Verified Answer:

Consider an array of seven numbers which is declared as: int array[ ] = {5, 16, 23, 34, 45, 56, 65} ; and the value to be searched for is 45. ...

Verified Answer:

Convert the following infix expression into a prefix expression. a) (X – Y) / (A + B). b) (X – Y / Z) * (A / B – C) ...

Verified Answer:

Sort the following array using merge sort. int array[ ] = { 40, 10, 86, 44, 93, 26, 69, 17 } ...

Verified Answer:

Consider the following array. Sort the given values in the array using the insertion sort technique. ...

Verified Answer:

Sort the given array using selection sort. ...

Verified Answer:

Let us now consider an example to search for a particular value in a sorted array. Consider an array of ten elements which is declared as: int array[10] = {0, 10, 20, 30, 40, 50, 60, 80, 90, 100}; and the value to be searched for is VAL = 20. Then the algorithm will proceed as follows: ...

Verified Answer:

Define the selection sort technique. ...

Verified Answer:

What is a binary search? Explain ...

Verified Answer:

Explain how a linear search technique is used to search for an element. ...

Verified Answer: