The number of interchanges required to sort 6, 2, 7, 3 5 in ascending order using Bubble Sort is _____________Select one:5763

Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted.

The given list is: 6, 2, 7, 3, 5

Let's sort it step by step:

1. Compare 6 and 2: 6 > 2, so swap. New list: 2, 6, 7, 3, 5
2. Compare 6 and 7: 6 < 7, so no swap.
3. Compare 7 and 3: 7 > 3, so swap. New list: 2, 6, 3, 7, 5
4. Compare 7 and 5: 7 > 5, so swap. New list: 2, 6, 3, 5, 7

After the first pass, the largest number 7 is at the right place. Now, repeat the process for the rest of the list.

1. Compare 2 and 6: 2 < 6, so no swap.
2. Compare 6 and 3: 6 > 3, so swap. New list: 2, 3, 6, 5, 7
3. Compare 6 and 5: 6 > 5, so swap. New list: 2, 3, 5, 6, 7

After the second pass, the second largest number 6 is at the right place. Now, repeat the process for the rest of the list.

1. Compare 2 and 3: 2 < 3, so no swap.
2. Compare 3 and 5: 3 < 5, so no swap.

After the third pass, the third largest number 5 is at the right place. Now, repeat the process for the rest of the list.

1. Compare 2 and 3: 2 < 3, so no swap.

After the fourth pass, the second smallest number 3 is at the right place. Now, repeat the process for the rest of the list.

The list is now sorted in ascending order: 2, 3, 5, 6, 7

So, the number of interchanges required to sort the list in ascending order using Bubble Sort is 5.