Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 2022a74

Browse files
fixed mergeSort algorithm
1 parent 4d1c6ea commit 2022a74

File tree

1 file changed

+5
-5
lines changed

1 file changed

+5
-5
lines changed

‎Sorts/MergeSort.js

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -58,15 +58,15 @@ function merge (list1, list2) {
5858
function mergeSort (list) {
5959
if (list.length < 2) return list
6060

61-
var listHalf = Math.floor(list.length / 2)
62-
var subList1 = list.slice(0, listHalf)
63-
var subList2 = list.slice(listHalf, list.length)
61+
const listHalf = Math.floor(list.length / 2)
62+
const subList1 = list.slice(0, listHalf)
63+
const subList2 = list.slice(listHalf, list.length)
6464

6565
return merge(mergeSort(subList1), mergeSort(subList2))
6666
}
6767

6868
// Merge Sort Example
69-
var unsortedArray = [10, 5, 3, 8, 2, 6, 4, 7, 9, 1]
70-
var sortedArray = mergeSort(unsortedArray)
69+
const unsortedArray = [10, 5, 3, 8, 2, 6, 4, 7, 9, 1]
70+
const sortedArray = mergeSort(unsortedArray)
7171

7272
console.log('Before:', unsortedArray, 'After:', sortedArray)

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /