fix:regex error in selection sort insertion sort and merge sort (#39230)

This commit is contained in:
Ruchi Kushwaha
2020-08-03 01:47:27 +05:30
committed by GitHub
parent 908adc2c37
commit 41ed64e8d4
3 changed files with 8 additions and 8 deletions

View File

@ -30,7 +30,7 @@ tests:
- 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(!code.match(/\.?[\s\S]*?sort/));
testString: assert(!code.match(/\.\s*sort\s*\(/));
```

View File

@ -34,7 +34,7 @@ tests:
- 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(!removeJSComments(code).match(/\.?[\s\S]*?sort\s*\(/));
testString: assert(!removeJSComments(code).match(/\.\s*sort\s*\(/));
```

View File

@ -30,7 +30,7 @@ tests:
- 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(!code.match(/\.?[\s\S]*?sort/));
testString: assert(!code.match(/\.\s*sort\s*\(/));
```
@ -76,17 +76,17 @@ function isSorted(arr) {
function selectionSort(array) {
for (let i = 0; i < array.length-1; i++) {
let minimumIndex = i;
for (let j = i+1; j < array.length; j++){
for (let j = i+1; j < array.length; j++){
if (array[j] < array[minimumIndex]) {
minimumIndex = j;
}
}
let value = array[minimumIndex];
array[minimumIndex] = array[i];
array[i] = value;
}
array[minimumIndex] = array[i];
array[i] = value;
}
return array;
}
}
```
</section>