Commitf2aebe7

committed

improve readability in some sorting algorithms

1 parent488b7a4 commitf2aebe7Copy full SHA for f2aebe7

File tree

-4269

lines changed

-4269

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@ import Sort from '../Sort';`
`2`	`2`
`3`	`3`	`exportdefaultclassInsertionSortextendsSort{`
`4`	`4`	`sort(originalArray){`
`5`		`-constarray=originalArray.slice(0);`
	`5`	`+constarray=[...originalArray];`
`6`	`6`
`7`	`7`	`// Go through all array elements...`
`8`	`8`	`for(leti=0;i<array.length;i+=1){`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,7 @@ import Sort from '../Sort';`
`3`	`3`	`exportdefaultclassQuickSortextendsSort{`
`4`	`4`	`sort(originalArray){`
`5`	`5`	`// Clone original array to prevent it from modification.`
`6`		`-constarray=originalArray.slice(0);`
	`6`	`+constarray=[...originalArray];`
`7`	`7`
`8`	`8`	`// If array has less then or equal to one elements then it is already sorted.`
`9`	`9`	`if(array.length<=1){`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,7 @@ import Sort from '../Sort';`
`3`	`3`	`exportdefaultclassSelectionSortextendsSort{`
`4`	`4`	`sort(originalArray){`
`5`	`5`	`// Clone original array to prevent its modification.`
`6`		`-constarray=originalArray.slice(0);`
	`6`	`+constarray=[...originalArray];`
`7`	`7`
`8`	`8`	`for(leti=0;i<array.length-1;i+=1){`
`9`	`9`	`letminIndex=i;`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,7 @@ import Sort from '../Sort';`
`3`	`3`	`exportdefaultclassShellSortextendsSort{`
`4`	`4`	`sort(originalArray){`
`5`	`5`	`// Prevent original array from mutations.`
`6`		`-constarray=originalArray.slice(0);`
	`6`	`+constarray=[...originalArray];`
`7`	`7`
`8`	`8`	`// Define a gap distance.`
`9`	`9`	`letgap=Math.floor(array.length/2);`

Comments

(0)