0 added
0 removed
Original
2026-01-01
Modified
2026-03-09
1
<p>Fix the sorting function so that the states of the array during sorting match the sample.</p>
1
<p>Fix the sorting function so that the states of the array during sorting match the sample.</p>
2
<p>To view the sample or test your program, click the button Boss, here’s your program!</p>
2
<p>To view the sample or test your program, click the button Boss, here’s your program!</p>
3
<p><strong>Solution</strong></p>
3
<p><strong>Solution</strong></p>
4
<p>The solution to the challenge will be available in a few minutes. Use it if you encounter difficulties. In the meantime, try to complete the challenge on your own.</p>
4
<p>The solution to the challenge will be available in a few minutes. Use it if you encounter difficulties. In the meantime, try to complete the challenge on your own.</p>
5
let arr = [1, 3, 5, 4, 1]; draw(arr); bubbleSort(arr); function bubbleSort(arr) { let len = arr.length - 1; for (let pass = 0; pass < len; pass++) { for (let j = 0; j < len - pass; j++) { if (arr[j] > arr[j + 1]) { let temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; draw(arr, j, j + 1); } } } }
5
let arr = [1, 3, 5, 4, 1]; draw(arr); bubbleSort(arr); function bubbleSort(arr) { let len = arr.length - 1; for (let pass = 0; pass < len; pass++) { for (let j = 0; j < len - pass; j++) { if (arr[j] > arr[j + 1]) { let temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; draw(arr, j, j + 1); } } } }