You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The coverage is improved by 13%, the code only hit three out of five branches and only set up two examples. I added a case where there is no unique letter.
218
236
219
-
220
237
## Almuthana Almustafa
221
238
222
-
stoogsort in stoog_sort.py
239
+
### Test 1: stoogsort
223
240
224
-
[Link to the commit in the founction files](https://github.com/CatalinAnt/algorithms-SEP-95/commit/57b66879c6ae0f82712c55528f540dfdb3c3ddd3)
225
-
226
-
result:
227
-
228
-

229
-
230
-
word_break in word_break.py
231
-
232
-
link to commit in founction:
233
-
[Link to the commit in the founction files](https://github.com/CatalinAnt/algorithms-SEP-95/commit/57b66879c6ae0f82712c55528f540dfdb3c3ddd3)
234
241
235
-
result:
236
-
237
-

238
-
239
-
Almuthana Almustafa
240
-
241
-
Test 1:
242
-
243
-
stoogsort function
244
242
245
243
link to commit in test files:
246
244
[Link to the commit in the test files](https://github.com/CatalinAnt/algorithms-SEP-95/commit/157de36fd4c373b67cd03e3b3713be9ba5cf0d97)
247
245
248
246
existing tool result before:
249
247
250
-

248
+

251
249
252
250
existing tool result after:
253
251
254
-

252
+

255
253
256
254
The coverage increased by 89%, largely attributable to the implementation of new tests.
257
255
258
-
Test 2:
259
-
260
-
word_break function
256
+
### Test 2: word_break
261
257
262
258
[Link to the commit in the test files](https://github.com/CatalinAnt/algorithms-SEP-95/commit/157de36fd4c373b67cd03e3b3713be9ba5cf0d97)
263
259
264
260
existing tool result before:
265
261
266
-

262
+

267
263
268
264
existing tool result after:
269
265
270
-

266
+

271
267
272
268
The coverage improved by 86% due to the creation of new tests.
0 commit comments