A star/Marcovchain/Combosort java script algorithm

src/algorithms/sorting/Combosort.js

@@ -0,0 +1,51 @@
+ function combsort(arr)
+
+{
+
+ function is_array_sorted(arr) {
+
+      var sorted = true;
+
+      for (var i = 0; i < arr.length - 1; i++) {
+
+          if (arr[i] > arr[i + 1]) {
+
+              sorted = false;
+
+              break;
+
+          }
+
+      }
+
+      return sorted;
+
+  }
+
+
+
+  var iteration_count = 0;
+
+  var gap = arr.length - 2;
+
+  var decrease_factor = 1.25;
+
+
+
+  // Repeat iterations Until array is not sorted
+
+
+
+
+  while (!is_array_sorted(arr)) 
+
+  {
+
+      // If not first gap  Calculate gap
+
+      if (iteration_count > 0)
+
+         gap = (gap == 1) ? gap : Math.floor(gap / decrease_factor);
+
+
+

src/algorithms/statistics/weighted-random/MarkovChain. Js

@@ -0,0 +1,51 @@
+function markovChainGenerator(text) {
+
+const textArr = text.split(' ')
+
+const markovChain = {};
+
+for (let i = 0; i < textArr.length; i++)
+
+ {
+
+let word = textArr[i].toLowerCase().replace(/[\W_]/, "")
+
+if (!markovChain[word])
+
+ {
+
+markovChain[word] = []
+
+}
+
+if (textArr[i + 1]) 
+
+{
+
+markovChain[word].push(textArr[i +1].toLowerCase().replace(/[\W_]/, ""));
+
+}
+
+}
+
+
+return markovChain
+
+}
+
+
+
+
+
+function likelyhood(chain, prev, word) 
+
+{
+
+const prevArr = chain[prev]
+
+const num = prevArr.filter
+
+(w => w === word).length
+
+return `The likelihood that ${word} will come after ${prev} is ${num} out of ${prevArr.length}`}
+