Movatterモバイル変換

Skip to content

coderaven/typescript-algorithmsPublic

forked fromtrekhleb/javascript-algorithms

NotificationsYou must be signed in to change notification settings
Fork0
Star0

Commit93bfe97

trekhleb

committed

Add test cases for sorting negative numbers and zeros.

1 parentd82958d commit93bfe97Copy full SHA for 93bfe97

File tree

10 files changed

+40

-2

lines changed

src/algorithms/sorting
- SortTester.js
- bubble-sort/__test__
  - BubbleSort.test.js
- counting-sort
  - CountingSort.js
- heap-sort/__test__
  - HeapSort.test.js
- insertion-sort/__test__
  - InsertionSort.test.js
- merge-sort/__test__
  - MergeSort.test.js
- quick-sort/__test__
  - QuickSort.test.js
  - QuickSortInPlace.test.js
- selection-sort/__test__
  - SelectionSort.test.js
- shell-sort/__test__
  - ShellSort.test.js

10 files changed

+40

-2

lines changed

`‎src/algorithms/sorting/SortTester.js`

Lines changed: 7 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,8 @@ export const sortedArr = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,`
`2`	`2`	`exportconstreverseArr=[20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1];`
`3`	`3`	`exportconstnotSortedArr=[15,8,5,12,10,1,16,9,11,7,20,3,2,6,17,18,4,13,14,19];`
`4`	`4`	`exportconstequalArr=[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1];`
	`5`	`+exportconstnegativeArr=[-1,0,5,-10,20,13,-7,3,2,-3];`
	`6`	`+exportconstnegativeArrSorted=[-10,-7,-3,-1,0,2,3,5,13,20];`
`5`	`7`
`6`	`8`	`exportclassSortTester{`
`7`	`9`	`statictestSort(SortingClass){`
`@@ -18,6 +20,11 @@ export class SortTester {`
`18`	`20`	`expect(sorter.sort(equalArr)).toEqual(equalArr);`
`19`	`21`	`}`
`20`	`22`
	`23`	`+statictestNegativeNumbersSort(SortingClass){`
	`24`	`+constsorter=newSortingClass();`
	`25`	`+expect(sorter.sort(negativeArr)).toEqual(negativeArrSorted);`
	`26`	`+}`
	`27`	`+`
`21`	`28`	`statictestSortWithCustomComparator(SortingClass){`
`22`	`29`	`constcallbacks={`
`23`	`30`	`compareCallback:(a,b)=>{`

`‎src/algorithms/sorting/bubble-sort/test/BubbleSort.test.js`

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -26,6 +26,10 @@ describe('BubbleSort', () => {`
`26`	`26`	`SortTester.testSortStability(BubbleSort);`
`27`	`27`	`});`
`28`	`28`
	`29`	`+it('should sort negative numbers',()=>{`
	`30`	`+SortTester.testNegativeNumbersSort(BubbleSort);`
	`31`	`+});`
	`32`	`+`
`29`	`33`	`it('should visit EQUAL array element specified number of times',()=>{`
`30`	`34`	`SortTester.testAlgorithmTimeComplexity(`
`31`	`35`	`BubbleSort,`

`‎src/algorithms/sorting/counting-sort/CountingSort.js`

Lines changed: 1 addition & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,8 +6,7 @@ export default class CountingSort extends Sort {`
`6`	`6`	`*@param {number} [biggestElement]`
`7`	`7`	`*/`
`8`	`8`	`sort(originalArray,biggestElement=0){`
`9`		`-// Detect biggest element in array in order to build in order to build`
`10`		`-// number bucket array later.`
	`9`	`+// Detect biggest element in array in order to build number bucket array later.`
`11`	`10`	`letdetectedBiggestElement=biggestElement;`
`12`	`11`	`if(!detectedBiggestElement){`
`13`	`12`	`originalArray.forEach((element)=>{`

`‎src/algorithms/sorting/heap-sort/test/HeapSort.test.js`

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -24,6 +24,10 @@ describe('HeapSort', () => {`
`24`	`24`	`SortTester.testSortWithCustomComparator(HeapSort);`
`25`	`25`	`});`
`26`	`26`
	`27`	`+it('should sort negative numbers',()=>{`
	`28`	`+SortTester.testNegativeNumbersSort(HeapSort);`
	`29`	`+});`
	`30`	`+`
`27`	`31`	`it('should visit EQUAL array element specified number of times',()=>{`
`28`	`32`	`SortTester.testAlgorithmTimeComplexity(`
`29`	`33`	`HeapSort,`

`‎src/algorithms/sorting/insertion-sort/test/InsertionSort.test.js`

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -26,6 +26,10 @@ describe('InsertionSort', () => {`
`26`	`26`	`SortTester.testSortStability(InsertionSort);`
`27`	`27`	`});`
`28`	`28`
	`29`	`+it('should sort negative numbers',()=>{`
	`30`	`+SortTester.testNegativeNumbersSort(InsertionSort);`
	`31`	`+});`
	`32`	`+`
`29`	`33`	`it('should visit EQUAL array element specified number of times',()=>{`
`30`	`34`	`SortTester.testAlgorithmTimeComplexity(`
`31`	`35`	`InsertionSort,`

`‎src/algorithms/sorting/merge-sort/test/MergeSort.test.js`

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -26,6 +26,10 @@ describe('MergeSort', () => {`
`26`	`26`	`SortTester.testSortStability(MergeSort);`
`27`	`27`	`});`
`28`	`28`
	`29`	`+it('should sort negative numbers',()=>{`
	`30`	`+SortTester.testNegativeNumbersSort(MergeSort);`
	`31`	`+});`
	`32`	`+`
`29`	`33`	`it('should visit EQUAL array element specified number of times',()=>{`
`30`	`34`	`SortTester.testAlgorithmTimeComplexity(`
`31`	`35`	`MergeSort,`

`‎src/algorithms/sorting/quick-sort/test/QuickSort.test.js`

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -26,6 +26,10 @@ describe('QuickSort', () => {`
`26`	`26`	`SortTester.testSortStability(QuickSort);`
`27`	`27`	`});`
`28`	`28`
	`29`	`+it('should sort negative numbers',()=>{`
	`30`	`+SortTester.testNegativeNumbersSort(QuickSort);`
	`31`	`+});`
	`32`	`+`
`29`	`33`	`it('should visit EQUAL array element specified number of times',()=>{`
`30`	`34`	`SortTester.testAlgorithmTimeComplexity(`
`31`	`35`	`QuickSort,`

`‎src/algorithms/sorting/quick-sort/test/QuickSortInPlace.test.js`

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -22,6 +22,10 @@ describe('QuickSortInPlace', () => {`
`22`	`22`	`SortTester.testSortWithCustomComparator(QuickSortInPlace);`
`23`	`23`	`});`
`24`	`24`
	`25`	`+it('should sort negative numbers',()=>{`
	`26`	`+SortTester.testNegativeNumbersSort(QuickSortInPlace);`
	`27`	`+});`
	`28`	`+`
`25`	`29`	`it('should visit EQUAL array element specified number of times',()=>{`
`26`	`30`	`SortTester.testAlgorithmTimeComplexity(`
`27`	`31`	`QuickSortInPlace,`

`‎src/algorithms/sorting/selection-sort/test/SelectionSort.test.js`

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -22,6 +22,10 @@ describe('SelectionSort', () => {`
`22`	`22`	`SortTester.testSortWithCustomComparator(SelectionSort);`
`23`	`23`	`});`
`24`	`24`
	`25`	`+it('should sort negative numbers',()=>{`
	`26`	`+SortTester.testNegativeNumbersSort(SelectionSort);`
	`27`	`+});`
	`28`	`+`
`25`	`29`	`it('should visit EQUAL array element specified number of times',()=>{`
`26`	`30`	`SortTester.testAlgorithmTimeComplexity(`
`27`	`31`	`SelectionSort,`

`‎src/algorithms/sorting/shell-sort/test/ShellSort.test.js`

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -22,6 +22,10 @@ describe('ShellSort', () => {`
`22`	`22`	`SortTester.testSortWithCustomComparator(ShellSort);`
`23`	`23`	`});`
`24`	`24`
	`25`	`+it('should sort negative numbers',()=>{`
	`26`	`+SortTester.testNegativeNumbersSort(ShellSort);`
	`27`	`+});`
	`28`	`+`
`25`	`29`	`it('should visit EQUAL array element specified number of times',()=>{`
`26`	`30`	`SortTester.testAlgorithmTimeComplexity(`
`27`	`31`	`ShellSort,`

0 commit comments

Comments

(0)

[8]ページ先頭

©2009-2025 Movatter.jp