fix(curriculum): changed test text to use should for Coding Interview Prep - part 1 of 2 (#37765)

* fix: changed test text to use should

* fix: corrected typo

Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>

* fix: corrected typo

Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>

* fix: corrected typo

Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>

* fix: use singular of verb

Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>

* fix: changed punctuation

Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>

* fix: reworded test text

Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>

curriculum/challenges/english/08-coding-interview-prep/algorithms/implement-bubble-sort.english.md

@@ -24,11 +24,11 @@ This method requires multiple iterations through the array and for average and w
 
 ```yml
 tests:
-  - text: <code>bubbleSort</code> is a function.
+  - text: <code>bubbleSort</code> should be a function.
     testString: assert(typeof bubbleSort == 'function');
-  - text: <code>bubbleSort</code> returns a sorted array (least to greatest).
+  - text: <code>bubbleSort</code> should return a sorted array (least to greatest).
     testString: assert(isSorted(bubbleSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])));
-  - text: <code>bubbleSort</code> returns an array that is unchanged except for order.
+  - text: <code>bubbleSort</code> should return an array that is unchanged except for order.
     testString: assert.sameMembers(bubbleSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]);
   - text: <code>bubbleSort</code> should not use the built-in <code>.sort()</code> method.
     testString: assert.strictEqual(code.search(/\.sort\(/), -1);

curriculum/challenges/english/08-coding-interview-prep/algorithms/implement-insertion-sort.english.md

@@ -22,11 +22,11 @@ The next sorting method we'll look at is insertion sort. This method works by bu
 
 ```yml
 tests:
-  - text: <code>insertionSort</code> is a function.
+  - text: <code>insertionSort</code> should be a function.
     testString: assert(typeof insertionSort == 'function');
-  - text: <code>insertionSort</code> returns a sorted array (least to greatest).
+  - text: <code>insertionSort</code> should return a sorted array (least to greatest).
     testString: assert(isSorted(insertionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])));
-  - text: <code>insertionSort</code> returns an array that is unchanged except for order.
+  - text: <code>insertionSort</code> should return an array that is unchanged except for order.
     testString: assert.sameMembers(insertionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]);
   - text: <code>insertionSort</code> should not use the built-in <code>.sort()</code> method.
     testString: assert.strictEqual(code.search(/\.sort\(/), -1);

curriculum/challenges/english/08-coding-interview-prep/algorithms/implement-merge-sort.english.md

@@ -26,11 +26,11 @@ As an aside, this will be the last sorting algorithm we cover here. However, lat
 
 ```yml
 tests:
-  - text: <code>mergeSort</code> is a function.
+  - text: <code>mergeSort</code> should be a function.
     testString: assert(typeof mergeSort == 'function');
-  - text: <code>mergeSort</code> returns a sorted array (least to greatest).
+  - text: <code>mergeSort</code> should return a sorted array (least to greatest).
     testString: assert(isSorted(mergeSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])));
-  - text: <code>mergeSort</code> returns an array that is unchanged except for order.
+  - text: <code>mergeSort</code> should return an array that is unchanged except for order.
     testString: assert.sameMembers(mergeSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]);
   - text: <code>mergeSort</code> should not use the built-in <code>.sort()</code> method.
     testString: assert.strictEqual(code.search(/\.sort\(/), -1);

curriculum/challenges/english/08-coding-interview-prep/algorithms/implement-quick-sort.english.md

@@ -23,11 +23,11 @@ Quick sort is a very efficient sorting method, providing <i>O(nlog(n))</i> perfo
 
 ```yml
 tests:
-  - text: <code>quickSort</code> is a function.
+  - text: <code>quickSort</code> should be a function.
     testString: assert(typeof quickSort == 'function');
-  - text: <code>quickSort</code> returns a sorted array (least to greatest).
+  - text: <code>quickSort</code> should return a sorted array (least to greatest).
     testString: assert(isSorted(quickSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])));
-  - text: <code>quickSort</code> returns an array that is unchanged except for order.
+  - text: <code>quickSort</code> should return an array that is unchanged except for order.
     testString: assert.sameMembers(quickSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]);
   - text: <code>quickSort</code> should not use the built-in <code>.sort()</code> method.
     testString: assert.strictEqual(code.search(/\.sort\(/), -1);

curriculum/challenges/english/08-coding-interview-prep/algorithms/implement-selection-sort.english.md

@@ -22,11 +22,11 @@ Here we will implement selection sort. Selection sort works by selecting the min
 
 ```yml
 tests:
-  - text: <code>selectionSort</code> is a function.
+  - text: <code>selectionSort</code> should be a function.
     testString: assert(typeof selectionSort == 'function');
-  - text: <code>selectionSort</code> returns a sorted array (least to greatest).
+  - text: <code>selectionSort</code> should return a sorted array (least to greatest).
     testString: assert(isSorted(selectionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92])));
-  - text: <code>selectionSort</code> returns an array that is unchanged except for order.
+  - text: <code>selectionSort</code> should return an array that is unchanged except for order.
     testString: assert.sameMembers(selectionSort([1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]), [1,4,2,8,345,123,43,32,5643,63,123,43,2,55,1,234,92]);
   - text: <code>selectionSort</code> should not use the built-in <code>.sort()</code> method.
     testString: assert.strictEqual(code.search(/\.sort\(/), -1);