Crowdly
Add to Chrome
The bubble sort algorithm sorts an array by placing the largest element in its p...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
The bubble sort algorithm sorts an array by placing the largest element in its place at each iteration. By stopping the algorithm as soon as the array is sorted, how many iterations does the array int T[6] = {-1, 3, 7, 42, 13, 21} need to be sorted?
❌
✅
❌
❌