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.
288
218
289
219
290
-
Almuthana Almustafa
220
+
## Almuthana Almustafa
291
221
292
222
stoogsort in stoog_sort.py
293
223
@@ -308,6 +238,8 @@ result:
308
238
309
239
Almuthana Almustafa
310
240
241
+
Test 1:
242
+
311
243
stoogsort function
312
244
313
245
link to commit in test files:
@@ -323,6 +255,8 @@ existing tool result after:
323
255
324
256
The coverage increased by 89%, largely attributable to the implementation of new tests.
325
257
258
+
Test 2:
259
+
326
260
word_break function
327
261
328
262
[Link to the commit in the test files](https://github.com/CatalinAnt/algorithms-SEP-95/commit/157de36fd4c373b67cd03e3b3713be9ba5cf0d97)
0 commit comments