add 算法

Author: Mayandev

算法与数据结构学习/algorithms/sort/quick-sort/quick-sort.js

@@ -8,7 +8,6 @@ function quickSort(arr, low, high) {
 
 function adjustArr(arr, low, high) {
   let pivot = arr[low];
-
   while (low < high) {
     while (arr[high] > pivot)
       high--;
@@ -24,4 +23,18 @@ function adjustArr(arr, low, high) {
 
 let arr = [72,6,57,88,60,42,83,73,48,85];
 quickSort(arr, 0, arr.length-1);
-console.log(arr);
+console.log(arr);
+
+function quickSort(arr) {
+  const pivot = arr[0];
+  const left = [];
+  const right = [];
+  
+  if (arr.length < 2) { return arr; }
+
+  for (let i = 1, len = arr.length; i < len; i++) {
+    arr[i] < pivot ? left.push(arr[i]) : right.push(arr[i]);
+  }
+
+  return quickSort(left).concat([pivot], quickSort(right));
+}

算法与数据结构学习/algorithms/sort/quick-sort/test.js

@@ -1,29 +1,13 @@
-function quickSort(arr, low, high) {
-  if (low < high) {
-    // 调整数组
-    let i = adjustArr(arr, low, high);
-    // 分治
-    quickSort(arr, low, i-1);
-    quickSort(arr, i+1, high);
-  } 
-}
-
-function adjustArr(arr, low, high) {
-  let pivot = arr[low];
+var myPow = function(x, n) {
+  return n > 0 ? quickMul(x, n) : 1.0 / quickMul(x, -n);
+};
 
-  while (low < high) {
-    while (low < high && arr[high] > pivot)
-      high--;
-      arr[low] = arr[high];
-    while (low < high && arr[low] < pivot)
-      low++;
-      arr[high] = arr[low];
+var quickMul = function(x, N) {
+  if (N == 0) {
+    return 1.0
   }
-
-  arr[low] = pivot;
-  return low;
+  let y = quickMul(x, Math.floor());
+  return N % 2 == 0 ? y * y : y * y * x;
 }
 
-let arr = [72,6,57,88,60,42,83,73,48,85];
-quickSort(arr, 0, arr.length-1);
-console.log(arr);
+console.log(myPow(2, 10));

算法与数据结构学习/data-structures/hash-table/Test.js

@@ -1,14 +1,18 @@
-import HashTable from './HashTable';
+// let k1 = [1,2,3];
+// let k2 = [3,4,5];
+// let k3 = [3,4,5];
+// let arr = [[k1, 'foo'], [k2, 'bar']];
 
-let hashTable = new HashTable();
+// let keys = arr.map(item => item[0]);
 
-hashTable.set('a', 'sky-old');
-hashTable.set('a', 'sky');
-hashTable.set('b', 'sea');
-hashTable.set('c', 'earth');
-hashTable.set('d', 'ocean');
+// console.log();
 
-hashTable.buckets[1].toString();
-console.log(hashTable.getKeys())
-console.log(hashTable.has);
 
+// console.log(keys.indexOf(k3));
+
+let arr = [1,2,3];
+let obj = {
+  arr: arr
+}
+
+console.log(obj.arr);

算法与数据结构学习/data-structures/heap/Heap.js

@@ -1,16 +1,12 @@
 export default class Heap {
   constructor(params) {
-
     // 不能直接通过 new 来创建堆
     if (new.target === Heap) {
       throw new TypeError('Cannot construct Heap instance directly');
     }
-
     this.heapContainer = [];
-
   }
 
-
   /**
    * 获取左孩子的下标
    */

算法与数据结构学习/data-structures/trie/test.js

@@ -0,0 +1,4 @@
+const p = Promise.resolve(1);
+
+p.then(console.log)
+p.then(console.log)