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

style: Fixed most styles (according to standardjs)

Browse Source
This commit is contained in:
Rak Laptudirm
2021-05-21 11:16:11 +05:30
parent 37ef611136
commit ca4c1a62af
22 changed files with 176 additions and 176 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
Sorts/MergeSort.js
View File

@ -35,7 +35,7 @@
*/
function merge (list1, list2) {
var results = []
const results = []
while (list1.length && list2.length) {
if (list1[0] <= list2[0]) {
@ -55,15 +55,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)