From 79ac4b3f238ce4b4da16c4dae63a7fd1b70e8b91 Mon Sep 17 00:00:00 2001
From: "Brady J. Garvin" <bgarvin@cse.unl.edu>
Date: Mon, 25 Sep 2023 21:08:43 -0500
Subject: [PATCH] Patched test cases that inadvertently enforced a specific
tie-breaking.
---
homework-2/src/subsequence.test.js | 12 ++++++------
1 file changed, 6 insertions(+), 6 deletions(-)
diff --git a/homework-2/src/subsequence.test.js b/homework-2/src/subsequence.test.js
index 5cb0dfc..901424d 100644
--- a/homework-2/src/subsequence.test.js
+++ b/homework-2/src/subsequence.test.js
@@ -64,7 +64,7 @@ describe('the findLongestSuitableSequence function', () => {
});
test('finds increasing terms at stride 1 in a length-7 list', () => {
expect(findLongestSuitableSequence([
- 20, 50, 0, 30, 40, 10, 60,
+ 60, 40, 0, 20, 50, 10, 30,
])).toEqual([
2, 3, 4,
]);
@@ -134,7 +134,7 @@ describe('the findLongestSuitableSequence function', () => {
});
test('finds increasing terms at stride 1 in a length-10 list', () => {
expect(findLongestSuitableSequence([
- 30, 10, 20, 40, 0, 90, 50, 60, 70, 80,
+ 40, 10, 20, 30, 0, 90, 50, 60, 70, 80,
])).toEqual([
6, 7, 8, 9,
]);
@@ -176,7 +176,7 @@ describe('the findLongestSuitableSequence function', () => {
});
test('finds increasing terms at stride 3 in a length-11 list', () => {
expect(findLongestSuitableSequence([
- 70, 90, 80, 10, 0, 50, 40, 30, 20, 100, 60,
+ 70, 90, 80, 10, 0, 60, 40, 50, 20, 100, 30,
])).toEqual([
3, 6, 9,
]);
@@ -302,7 +302,7 @@ describe('the findLongestSuitableSequence function', () => {
});
test('finds increasing terms at stride 5 in a length-14 list', () => {
expect(findLongestSuitableSequence([
- 50, 90, 30, 0, 130, 110, 60, 80, 70, 20, 40, 10, 120, 100,
+ 80, 90, 30, 0, 130, 110, 60, 50, 100, 20, 40, 10, 120, 70,
])).toEqual([
2, 7, 12,
]);
@@ -323,7 +323,7 @@ describe('the findLongestSuitableSequence function', () => {
});
test('finds increasing terms at stride 2 in a length-15 list', () => {
expect(findLongestSuitableSequence([
- 110, 40, 70, 50, 10, 80, 60, 20, 130, 30, 120, 90, 100, 140, 0,
+ 110, 40, 70, 50, 120, 80, 60, 20, 130, 30, 10, 100, 90, 140, 0,
])).toEqual([
7, 9, 11, 13,
]);
@@ -344,7 +344,7 @@ describe('the findLongestSuitableSequence function', () => {
});
test('finds increasing terms at stride 5 in a length-15 list', () => {
expect(findLongestSuitableSequence([
- 90, 120, 40, 10, 140, 0, 130, 60, 70, 50, 110, 20, 100, 30, 80,
+ 90, 120, 40, 10, 140, 0, 130, 60, 80, 50, 110, 20, 100, 30, 70,
])).toEqual([
2, 7, 12,
]);
--
GitLab