We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 6f9b7d2 commit 0baef42Copy full SHA for 0baef42
src/test/java/sort/SelectionSort.java
@@ -35,7 +35,7 @@ public int[] solution(int[] arr) {
35
36
for (int i = 0; i < result.length - 1; i++) {
37
maxPos = i;
38
- for (int k = i + 1g; k < result.length; k++) {
+ for (int k = i + 1; k < result.length; k++) {
39
if (result[maxPos] > result[k]) {
40
maxPos = k;
41
}
0 commit comments