Created
September 2, 2020 15:52
-
-
Save AleksandrChukhray/97f5cfde9263ad369e536cbf71c9ea66 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Merge Sort Implentation (Recursion) | |
| function mergeSort (unsortedArray) { | |
| // No need to sort the array if the array only has one element or empty | |
| if (unsortedArray.length <= 1) { | |
| return unsortedArray; | |
| } | |
| // In order to divide the array in half, we need to figure out the middle | |
| const middle = Math.floor(unsortedArray.length / 2); | |
| // This is where we will be dividing the array into left and right | |
| const left = unsortedArray.slice(0, middle); | |
| const right = unsortedArray.slice(middle); | |
| // Using recursion to combine the left and right | |
| return merge( | |
| mergeSort(left), mergeSort(right) | |
| ); | |
| } | |
| // Merge the two arrays: left and right | |
| function merge (left, right) { | |
| let resultArray = [], leftIndex = 0, rightIndex = 0; | |
| // We will concatenate values into the resultArray in order | |
| while (leftIndex < left.length && rightIndex < right.length) { | |
| if (left[leftIndex] < right[rightIndex]) { | |
| resultArray.push(left[leftIndex]); | |
| leftIndex++; // move left array cursor | |
| } else { | |
| resultArray.push(right[rightIndex]); | |
| rightIndex++; // move right array cursor | |
| } | |
| } | |
| // We need to concat here because there will be one element remaining | |
| // from either left OR the right | |
| return resultArray | |
| .concat(left.slice(leftIndex)) | |
| .concat(right.slice(rightIndex)); | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment