chapter 12: [Sorting and Searching Algorithms]

loiane · loiane · commit b68ac1faa4ef · 2018-01-21T10:03:23.000-02:00
diff --git a/examples/chapter12/01-BubbleSort.html b/examples/chapter12/01-BubbleSort.html
@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="./../PacktDataStructuresAlgorithms.min.js"></script>
+  <script src="01-BubbleSort.js"></script>
+</body>
+</html>
diff --git a/examples/chapter12/01-BubbleSort.js b/examples/chapter12/01-BubbleSort.js
@@ -0,0 +1,12 @@
+const { bubbleSort } = PacktDataStructuresAlgorithms;
+
+function createNonSortedArray(){
+  var array = [];
+  for (let i = 5; i > 0; i--){
+      array.push(i);
+  }
+  return array;
+}
+
+const array = bubbleSort(createNonSortedArray());
+console.log(array);
diff --git a/examples/chapter12/01-BucketSort.html b/examples/chapter12/01-BucketSort.html
@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="./../PacktDataStructuresAlgorithms.min.js"></script>
+  <script src="01-BubbleSort.js"></script>
+</body>
+</html>
diff --git a/examples/chapter12/01-BucketSort.js b/examples/chapter12/01-BucketSort.js
@@ -0,0 +1,12 @@
+const { bubbleSort } = PacktDataStructuresAlgorithms;
+
+function createNonSortedArray(){
+  var array = [];
+  for (let i = 5; i > 0; i--){
+      array.push(i);
+  }
+  return array;
+}
+
+const array = bubbleSort(createNonSortedArray());
+console.log(array);
diff --git a/examples/chapter12/01-CountingSort.html b/examples/chapter12/01-CountingSort.html
@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="./../PacktDataStructuresAlgorithms.min.js"></script>
+  <script src="01-BubbleSort.js"></script>
+</body>
+</html>
diff --git a/examples/chapter12/01-CountingSort.js b/examples/chapter12/01-CountingSort.js
@@ -0,0 +1,12 @@
+const { bubbleSort } = PacktDataStructuresAlgorithms;
+
+function createNonSortedArray(){
+  var array = [];
+  for (let i = 5; i > 0; i--){
+      array.push(i);
+  }
+  return array;
+}
+
+const array = bubbleSort(createNonSortedArray());
+console.log(array);
diff --git a/examples/chapter12/01-InsertionSort.html b/examples/chapter12/01-InsertionSort.html
@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="./../PacktDataStructuresAlgorithms.min.js"></script>
+  <script src="01-BubbleSort.js"></script>
+</body>
+</html>
diff --git a/examples/chapter12/01-InsertionSort.js b/examples/chapter12/01-InsertionSort.js
@@ -0,0 +1,12 @@
+const { bubbleSort } = PacktDataStructuresAlgorithms;
+
+function createNonSortedArray(){
+  var array = [];
+  for (let i = 5; i > 0; i--){
+      array.push(i);
+  }
+  return array;
+}
+
+const array = bubbleSort(createNonSortedArray());
+console.log(array);
diff --git a/examples/chapter12/01-MergeSort.html b/examples/chapter12/01-MergeSort.html
@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="./../PacktDataStructuresAlgorithms.min.js"></script>
+  <script src="01-BubbleSort.js"></script>
+</body>
+</html>
diff --git a/examples/chapter12/01-MergeSort.js b/examples/chapter12/01-MergeSort.js
@@ -0,0 +1,12 @@
+const { bubbleSort } = PacktDataStructuresAlgorithms;
+
+function createNonSortedArray(){
+  var array = [];
+  for (let i = 5; i > 0; i--){
+      array.push(i);
+  }
+  return array;
+}
+
+const array = bubbleSort(createNonSortedArray());
+console.log(array);
diff --git a/examples/chapter12/01-QuickSort.html b/examples/chapter12/01-QuickSort.html
@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="./../PacktDataStructuresAlgorithms.min.js"></script>
+  <script src="01-BubbleSort.js"></script>
+</body>
+</html>
diff --git a/examples/chapter12/01-QuickSort.js b/examples/chapter12/01-QuickSort.js
@@ -0,0 +1,12 @@
+const { bubbleSort } = PacktDataStructuresAlgorithms;
+
+function createNonSortedArray(){
+  var array = [];
+  for (let i = 5; i > 0; i--){
+      array.push(i);
+  }
+  return array;
+}
+
+const array = bubbleSort(createNonSortedArray());
+console.log(array);
diff --git a/examples/chapter12/01-RadixSort.html b/examples/chapter12/01-RadixSort.html
@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="./../PacktDataStructuresAlgorithms.min.js"></script>
+  <script src="01-BubbleSort.js"></script>
+</body>
+</html>
diff --git a/examples/chapter12/01-RadixSort.js b/examples/chapter12/01-RadixSort.js
@@ -0,0 +1,12 @@
+const { bubbleSort } = PacktDataStructuresAlgorithms;
+
+function createNonSortedArray(){
+  var array = [];
+  for (let i = 5; i > 0; i--){
+      array.push(i);
+  }
+  return array;
+}
+
+const array = bubbleSort(createNonSortedArray());
+console.log(array);
diff --git a/examples/chapter12/01-SelectionSort.html b/examples/chapter12/01-SelectionSort.html
@@ -0,0 +1,11 @@
+<!DOCTYPE html>
+<html>
+<head>
+    <meta charset="UTF-8">
+    <title></title>
+</head>
+<body>
+  <script src="./../PacktDataStructuresAlgorithms.min.js"></script>
+  <script src="01-BubbleSort.js"></script>
+</body>
+</html>
diff --git a/examples/chapter12/01-SelectionSort.js b/examples/chapter12/01-SelectionSort.js
@@ -0,0 +1,12 @@
+const { bubbleSort } = PacktDataStructuresAlgorithms;
+
+function createNonSortedArray(){
+  var array = [];
+  for (let i = 5; i > 0; i--){
+      array.push(i);
+  }
+  return array;
+}
+
+const array = bubbleSort(createNonSortedArray());
+console.log(array);
diff --git a/src/js/algorithms/sorting/radix-sort.js b/src/js/algorithms/sorting/radix-sort.js
@@ -1,5 +1,9 @@
 import { findMaxValue, findMinValue } from '../search/min-max-search';
 
+const getBucketIndex = (value, minValue, significantDigit, radixBase) => {
+  return Math.floor(((value - minValue) / significantDigit) % radixBase);
+};
+
 const countingSortForRadix = (array, radixBase, significantDigit, minValue) => {
   let bucketsIndex;
   const buckets = [];
@@ -8,14 +12,14 @@ const countingSortForRadix = (array, radixBase, significantDigit, minValue) => {
     buckets[i] = 0;
   }
   for (let i = 0; i < array.length; i++) {
-    bucketsIndex = Math.floor(((array[i] - minValue) / significantDigit) % radixBase);
+    bucketsIndex = getBucketIndex(array[i], minValue, significantDigit, radixBase);
     buckets[bucketsIndex]++;
   }
   for (let i = 1; i < radixBase; i++) {
     buckets[i] += buckets[i - 1];
   }
   for (let i = array.length - 1; i >= 0; i--) {
-    bucketsIndex = Math.floor(((array[i] - minValue) / significantDigit) % radixBase);
+    bucketsIndex = getBucketIndex(array[i], minValue, significantDigit, radixBase);
     aux[--buckets[bucketsIndex]] = array[i];
   }
   for (let i = 0; i < array.length; i++) {
diff --git a/src/js/util.js b/src/js/util.js
@@ -6,12 +6,12 @@ export const Compare = {
 
 export const DOES_NOT_EXIST = -1;
 
-export function lesserEquals(a, b, compareFn) {
+export function lesserOrEquals(a, b, compareFn) {
   const comp = compareFn(a, b);
   return comp === Compare.LESS_THAN || comp === Compare.EQUALS;
 }
 
-export function biggerEquals(a, b, compareFn) {
+export function biggerOrEquals(a, b, compareFn) {
   const comp = compareFn(a, b);
   return comp === Compare.BIGGER_THAN || comp === Compare.EQUALS;
 }
diff --git a/src/ts/algorithms/shuffle/fisher–yates.ts b/src/ts/algorithms/shuffle/fisher–yates.ts
@@ -1,12 +1,9 @@
 import { swap } from '../../util';
 
 export function shuffle<T>(array: T[]) {
-  let currentIndex = array.length;
-
-  while (currentIndex !== 0) {
-    const randomIndex = Math.floor(Math.random() * currentIndex);
-    currentIndex--;
-    swap(array, currentIndex, randomIndex);
+  for (let i = array.length - 1; i > 0; i--) {
+    const randomIndex = Math.floor(Math.random() * (i + 1));
+    swap(array, i, randomIndex);
   }
 
   return array;
diff --git a/src/ts/algorithms/sorting/radix-sort.ts b/src/ts/algorithms/sorting/radix-sort.ts
@@ -28,6 +28,9 @@ const countingSortForRadix = (
     aux[--buckets[bucketsIndex]] = array[i];
   }
 
+
+  // array = [];
+  // array.push(...aux);
   for (let i = 0; i < array.length; i++) {
     array[i] = aux[i];
   }
