Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix a bug #1250

Browse Source
This commit is contained in:
MK 2020-03-18 18:19:16 +08:00
parent f3f2661d35
commit 7b1c328594
3 changed files with 6 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/main/java/com/sorts/CycleSort.java
View File

@ -15,7 +15,7 @@ public class CycleSort {
int count = 0; int count = 0;
// Traverse array and put the elements on their respective right places // Traverse array and put the elements on their respective right places
for (int i = 0; i < n - 2; i++) { for (int i = 0; i < n - 1; i++) {
// Initialize item as the starting point // Initialize item as the starting point
T item = arr[i]; T item = arr[i];

4
src/test/java/com/dataStructures/StackTest.java
View File

@ -36,7 +36,7 @@ class StackTest {
myStack.push(30); myStack.push(30);
myStack.push(40); myStack.push(40);
Assertions.assertEquals(40, myStack.peek()); Assertions.assertEquals(40, (int) myStack.peek());
} }
@Test @Test
@ -57,7 +57,7 @@ class StackTest {
myStack.push(40); myStack.push(40);
myStack.push(50); myStack.push(50);
Assertions.assertEquals(50, myStack.pop()); Assertions.assertEquals(50, (int) myStack.pop());
} }

3
src/test/java/com/sorts/CycleSortTest.java
View File

@ -30,5 +30,8 @@ class CycleSortTest {
String[] sortedStr = new String[]{"Alan", "David", "Dennis", "Edward", "Ken", "Linus", "Robert"}; String[] sortedStr = new String[]{"Alan", "David", "Dennis", "Edward", "Ken", "Linus", "Robert"};
Assertions.assertArrayEquals(sortedStr, cycleSort.sort(unsortedStr)); Assertions.assertArrayEquals(sortedStr, cycleSort.sort(unsortedStr));
Integer[] unsortedShortInt = new Integer[]{29, 11};
Integer[] sortedShortInt = new Integer[]{11, 29};
Assertions.assertArrayEquals(sortedShortInt, cycleSort.sort(unsortedShortInt));
} }
} }