algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 08:16:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #599 from guyariely/master

Browse Source 
fixed the merge implementation in MergeSort
This commit is contained in:
Omkarnath Parida
2021-05-22 19:54:16 +05:30
committed by GitHub
parent 2c1eba4ea6 2022a74286
commit d220eb987a
1 changed files with 14 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
Sorts/MergeSort.js
View File

@ -35,16 +35,19 @@
*/
function merge (list1, list2) {
var results = []
const results = []
let i = 0
let j = 0
while (list1.length && list2.length) {
if (list1[0] <= list2[0]) {
results.push(list1.shift())
while (i < list1.length && j < list2.length) {
if (list1[i] < list2[j]) {
results.push(list1[i++])
} else {
results.push(list2.shift())
results.push(list2[j++])
}
}
return results.concat(list1, list2)
return results.concat(list1.slice(i), list2.slice(j))
}
/**
@ -55,15 +58,15 @@ function merge (list1, list2) {
function mergeSort (list) {
if (list.length < 2) return list
var listHalf = Math.floor(list.length / 2)
var subList1 = list.slice(0, listHalf)
var subList2 = list.slice(listHalf, list.length)
const listHalf = Math.floor(list.length / 2)
const subList1 = list.slice(0, listHalf)
const subList2 = list.slice(listHalf, list.length)
return merge(mergeSort(subList1), mergeSort(subList2))
}
// Merge Sort Example
var unsortedArray = [10, 5, 3, 8, 2, 6, 4, 7, 9, 1]
var sortedArray = mergeSort(unsortedArray)
const unsortedArray = [10, 5, 3, 8, 2, 6, 4, 7, 9, 1]
const sortedArray = mergeSort(unsortedArray)
console.log('Before:', unsortedArray, 'After:', sortedArray)