[Sorting and Searching Algorithms]

loiane · loiane · commit 6b5cc0ce2b11 · 2017-12-30T19:04:19.000-02:00
diff --git a/examples/PacktDataStructuresAlgorithms.min.js b/examples/PacktDataStructuresAlgorithms.min.js
diff --git a/src/js/algorithms/sorting/bucket-sort.js b/src/js/algorithms/sorting/bucket-sort.js
@@ -25,9 +25,7 @@ function sortBuckets(buckets) {
   for (let i = 0; i < buckets.length; i++) {
     if (buckets[i] != null) {
       insertionSort(buckets[i]);
-      for (let j = 0; j < buckets[i].length; j++) {
-        sortedArray.push(buckets[i][j]);
-      }
+      sortedArray.push(...buckets[i]);
     }
   }
   return sortedArray;
diff --git a/src/ts/algorithms/sorting/bucket-sort.ts b/src/ts/algorithms/sorting/bucket-sort.ts
@@ -30,9 +30,7 @@ function sortBuckets(buckets: number[][]) {
     if (buckets[i] != null) {
       insertionSort(buckets[i]);
 
-      for (let j = 0; j < buckets[i].length; j++) {
-        sortedArray.push(buckets[i][j]);
-      }
+      sortedArray.push(...buckets[i]);
     }
   }
 

Original file line number	Diff line number	Diff line change
`@@ -25,9 +25,7 @@ function sortBuckets(buckets) {`
`25`	`25`	`for (let i = 0; i < buckets.length; i++) {`
`26`	`26`	`if (buckets[i] != null) {`
`27`	`27`	`insertionSort(buckets[i]);`
`28`		`- for (let j = 0; j < buckets[i].length; j++) {`
`29`		`- sortedArray.push(buckets[i][j]);`
`30`		`- }`
	`28`	`+ sortedArray.push(...buckets[i]);`
`31`	`29`	`}`
`32`	`30`	`}`
`33`	`31`	`return sortedArray;`
Original file line number	Diff line number	Diff line change
`@@ -30,9 +30,7 @@ function sortBuckets(buckets: number[][]) {`
`30`	`30`	`if (buckets[i] != null) {`
`31`	`31`	`insertionSort(buckets[i]);`
`32`	`32`
`33`		`- for (let j = 0; j < buckets[i].length; j++) {`
`34`		`- sortedArray.push(buckets[i][j]);`
`35`		`- }`
	`33`	`+ sortedArray.push(...buckets[i]);`
`36`	`34`	`}`
`37`	`35`	`}`
`38`	`36`