Repository navigation
Expand file tree
/
Copy pathSortStackTest.java
More file actions
260 lines (222 loc) · 7.26 KB
/
Copy pathSortStackTest.java
File metadata and controls
260 lines (222 loc) · 7.26 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
package com.thealgorithms.stacks;
import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.assertTrue;
import java.util.Stack;
import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.Test;
public class SortStackTest {
private Stack<Integer> stack;
@BeforeEach
public void setUp() {
stack = new Stack<>();
}
@Test
public void testSortEmptyStack() {
SortStack.sortStack(stack);
assertTrue(stack.isEmpty()); // An empty stack should remain empty
}
@Test
public void testSortSingleElementStack() {
stack.push(10);
SortStack.sortStack(stack);
assertEquals(1, stack.size());
assertEquals(10, (int) stack.peek()); // Single element should remain unchanged
}
@Test
public void testSortAlreadySortedStack() {
stack.push(1);
stack.push(2);
stack.push(3);
stack.push(4);
SortStack.sortStack(stack);
assertEquals(4, stack.size());
assertEquals(4, (int) stack.pop());
assertEquals(3, (int) stack.pop());
assertEquals(2, (int) stack.pop());
assertEquals(1, (int) stack.pop());
}
@Test
public void testSortUnsortedStack() {
stack.push(3);
stack.push(1);
stack.push(4);
stack.push(2);
SortStack.sortStack(stack);
assertEquals(4, stack.size());
assertEquals(4, (int) stack.pop());
assertEquals(3, (int) stack.pop());
assertEquals(2, (int) stack.pop());
assertEquals(1, (int) stack.pop());
}
@Test
public void testSortWithDuplicateElements() {
stack.push(3);
stack.push(1);
stack.push(3);
stack.push(2);
SortStack.sortStack(stack);
assertEquals(4, stack.size());
assertEquals(3, (int) stack.pop());
assertEquals(3, (int) stack.pop());
assertEquals(2, (int) stack.pop());
assertEquals(1, (int) stack.pop());
}
@Test
public void testSortReverseSortedStack() {
// Test worst case scenario - completely reverse sorted
stack.push(5);
stack.push(4);
stack.push(3);
stack.push(2);
stack.push(1);
SortStack.sortStack(stack);
assertEquals(5, stack.size());
assertEquals(5, (int) stack.pop());
assertEquals(4, (int) stack.pop());
assertEquals(3, (int) stack.pop());
assertEquals(2, (int) stack.pop());
assertEquals(1, (int) stack.pop());
}
@Test
public void testSortWithAllSameElements() {
// Test stack with all identical elements
stack.push(7);
stack.push(7);
stack.push(7);
stack.push(7);
SortStack.sortStack(stack);
assertEquals(4, stack.size());
assertEquals(7, (int) stack.pop());
assertEquals(7, (int) stack.pop());
assertEquals(7, (int) stack.pop());
assertEquals(7, (int) stack.pop());
}
@Test
public void testSortWithNegativeNumbers() {
// Test with negative numbers
stack.push(-3);
stack.push(1);
stack.push(-5);
stack.push(2);
stack.push(-1);
SortStack.sortStack(stack);
assertEquals(5, stack.size());
assertEquals(2, (int) stack.pop());
assertEquals(1, (int) stack.pop());
assertEquals(-1, (int) stack.pop());
assertEquals(-3, (int) stack.pop());
assertEquals(-5, (int) stack.pop());
}
@Test
public void testSortWithAllNegativeNumbers() {
// Test with only negative numbers
stack.push(-10);
stack.push(-5);
stack.push(-15);
stack.push(-1);
SortStack.sortStack(stack);
assertEquals(4, stack.size());
assertEquals(-1, (int) stack.pop());
assertEquals(-5, (int) stack.pop());
assertEquals(-10, (int) stack.pop());
assertEquals(-15, (int) stack.pop());
}
@Test
public void testSortWithZero() {
// Test with zero included
stack.push(3);
stack.push(0);
stack.push(-2);
stack.push(1);
SortStack.sortStack(stack);
assertEquals(4, stack.size());
assertEquals(3, (int) stack.pop());
assertEquals(1, (int) stack.pop());
assertEquals(0, (int) stack.pop());
assertEquals(-2, (int) stack.pop());
}
@Test
public void testSortLargerStack() {
// Test with a larger number of elements
int[] values = {15, 3, 9, 1, 12, 6, 18, 4, 11, 8};
for (int value : values) {
stack.push(value);
}
SortStack.sortStack(stack);
assertEquals(10, stack.size());
// Verify sorted order (largest to smallest when popping)
int[] expectedOrder = {18, 15, 12, 11, 9, 8, 6, 4, 3, 1};
for (int expected : expectedOrder) {
assertEquals(expected, (int) stack.pop());
}
}
@Test
public void testSortTwoElements() {
// Test edge case with exactly two elements
stack.push(5);
stack.push(2);
SortStack.sortStack(stack);
assertEquals(2, stack.size());
assertEquals(5, (int) stack.pop());
assertEquals(2, (int) stack.pop());
}
@Test
public void testSortTwoElementsAlreadySorted() {
// Test two elements already in correct order
stack.push(2);
stack.push(5);
SortStack.sortStack(stack);
assertEquals(2, stack.size());
assertEquals(5, (int) stack.pop());
assertEquals(2, (int) stack.pop());
}
@Test
public void testSortStackWithMinAndMaxValues() {
// Test with Integer.MAX_VALUE and Integer.MIN_VALUE
stack.push(0);
stack.push(Integer.MAX_VALUE);
stack.push(Integer.MIN_VALUE);
stack.push(100);
SortStack.sortStack(stack);
assertEquals(4, stack.size());
assertEquals(Integer.MAX_VALUE, (int) stack.pop());
assertEquals(100, (int) stack.pop());
assertEquals(0, (int) stack.pop());
assertEquals(Integer.MIN_VALUE, (int) stack.pop());
}
@Test
public void testSortWithManyDuplicates() {
// Test with multiple sets of duplicates
stack.push(3);
stack.push(1);
stack.push(3);
stack.push(1);
stack.push(2);
stack.push(2);
stack.push(3);
SortStack.sortStack(stack);
assertEquals(7, stack.size());
assertEquals(3, (int) stack.pop());
assertEquals(3, (int) stack.pop());
assertEquals(3, (int) stack.pop());
assertEquals(2, (int) stack.pop());
assertEquals(2, (int) stack.pop());
assertEquals(1, (int) stack.pop());
assertEquals(1, (int) stack.pop());
}
@Test
public void testOriginalStackIsModified() {
// Verify that the original stack is modified, not a copy
Stack<Integer> originalReference = stack;
stack.push(3);
stack.push(1);
stack.push(2);
SortStack.sortStack(stack);
// Verify it's the same object reference
assertTrue(stack == originalReference);
assertEquals(3, stack.size());
assertEquals(3, (int) stack.pop());
assertEquals(2, (int) stack.pop());
assertEquals(1, (int) stack.pop());
}
}