hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-09-20 07:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix ESLint issues with MergeSort.

Browse Source
This commit is contained in:
Oleksii Trekhleb 2020-11-28 16:43:29 +01:00
parent 83978e9d2d
commit 2c74ced8af
1 changed files with 15 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
src/algorithms/sorting/merge-sort/MergeSort.js
View File

@ -1,4 +1,4 @@
import Sort from "../Sort"; import Sort from '../Sort';
export default class MergeSort extends Sort { export default class MergeSort extends Sort {
sort(originalArray) { sort(originalArray) {
@ -26,38 +26,33 @@ export default class MergeSort extends Sort {
mergeSortedArrays(leftArray, rightArray) { mergeSortedArrays(leftArray, rightArray) {
const sortedArray = []; const sortedArray = [];
// Use array pointers to exclude old elements after they have been added to the sorted array // Use array pointers to exclude old elements after they have been added to the sorted array.
let leftIndex = 0; let leftIndex = 0;
let rightIndex = 0; let rightIndex = 0;
while (leftIndex < leftArray.length && rightIndex < rightArray.length) { while (leftIndex < leftArray.length && rightIndex < rightArray.length) {
// Find the minimum element between the left and right array let minElement = null;
if (
this.comparator.lessThanOrEqual(
leftArray[leftIndex],
rightArray[rightIndex]
)
) {
sortedArray.push(leftArray[leftIndex]);
// Find the minimum element between the left and right array.
if (this.comparator.lessThanOrEqual(leftArray[leftIndex], rightArray[rightIndex])) {
minElement = leftArray[leftIndex];
// Increment index pointer to the right // Increment index pointer to the right
leftIndex += 1; leftIndex += 1;
// Call visiting callback.
this.callbacks.visitingCallback(leftArray[leftIndex]);
} else { } else {
sortedArray.push(rightArray[rightIndex]); minElement = rightArray[rightIndex];
// Increment index pointer to the right // Increment index pointer to the right
rightIndex += 1; rightIndex += 1;
// Call visiting callback.
this.callbacks.visitingCallback(rightArray[rightIndex]);
} }
// Add the minimum element to the sorted array.
sortedArray.push(minElement);
// Call visiting callback.
this.callbacks.visitingCallback(minElement);
} }
// There will be one element remaining from either the left OR the right // There will be elements remaining from either the left OR the right
// Concatenate the remaining element into the sorted array // Concatenate the remaining elements into the sorted array
return sortedArray return sortedArray
.concat(leftArray.slice(leftIndex)) .concat(leftArray.slice(leftIndex))
.concat(rightArray.slice(rightIndex)); .concat(rightArray.slice(rightIndex));