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

merge: Add test case and fix TimSort algo (#977)

Browse Source
This commit is contained in:
Ankush263
2022-04-03 16:28:36 +05:30
committed by GitHub
parent 2169e17d47
commit 35035f7afa
2 changed files with 26 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
Sorts/TimSort.js
View File

@ -25,6 +25,7 @@ const Timsort = (array) => {
Merge(array, left, mid, right)
}
}
return array
}
/**

25
Sorts/test/TimSort.test.js Normal file
View File

@ -0,0 +1,25 @@
import { Timsort } from '../TimSort'
test('The Timsort of the array [5, 4, 3, 2, 1] is [1, 2, 3, 4, 5]', () => {
const arr = [5, 4, 3, 2, 1]
const res = Timsort(arr)
expect(res).toEqual([1, 2, 3, 4, 5])
})
test('The Timsort of the array [] is []', () => {
const arr = []
const res = Timsort(arr)
expect(res).toEqual([])
})
test('The Timsort of the array [-5, -4, -3, -2, -1] is [-5, -4, -3, -2, -1]', () => {
const arr = [-5, -4, -3, -2, -1]
const res = Timsort(arr)
expect(res).toEqual([-5, -4, -3, -2, -1])
})
test('The Timsort of the array [9, 0, -5, -11, 3] is [-11, -5, 0, 3, 9]', () => {
const arr = [9, 0, -5, -11, 3]
const res = Timsort(arr)
expect(res).toEqual([-11, -5, 0, 3, 9])
})