Which of the sorting algorithms that we discussed makes several passes through an array and causes the larger values to move gradually toward the end of the array with each pass?

Bubble Sort is a simple sorting algorithm that repeatedly steps through the given array and compares each pair of adjacent elements and swaps them if they are in the wrong order. The pass through the array is repeated until the list is sorted. With each pass, the larger element in the pair moves towards the end of the array, which is why it's called Bubble Sort.

Let's consider a simple array [21, 14, 9, 4] to illustrate how Bubble Sort works: Pass 1: - Compare 21 and 14, swap them: [14, 21, 9, 4] - Compare 21 and 9, swap them: [14, 9, 21, 4] - Compare 21 and 4, swap them: [14, 9, 4, 21] After the first pass, the largest element (21) has moved to the end. Pass 2: - Compare 14 and 9, swap them: [9, 14, 4, 21] - Compare 14 and 4, swap them: [9, 4, 14, 21] After the second pass, the second largest element (14) has moved to the second last position in the array. Pass 3: - Compare 9 and 4, swap them: [4, 9, 14, 21] After the third pass, the array is now sorted. The Bubble Sort algorithm compares each adjacent pair of elements and swaps them if they are in the wrong order, causing the larger values to move towards the end of the array with each pass.