update

vJechsmayr · vJechsmayr · commit 68d4905b38c6 · 2019-10-07T22:06:48.000+02:00
diff --git a/DataStructures/Linked List/Algorithms_toDo.md b/DataStructures/Linked List/Algorithms_toDo.md
@@ -1,6 +1,5 @@
 # Algorithms ToDo
 
-+ linked list
 + double linked list
 + is palindrome
 + sqap nodes
diff --git a/Maths/fibonacci.js b/Maths/fibonacci.js
@@ -1,11 +1,12 @@
-n = 10
+function fibonacci(n) {
+  var a = 0, b = 1, temp = 1;
+  for (let i = 2; i <= n; i++) {
+    temp = a + b;
+    a = b;
+    b = temp;
+    console.log(temp);
+  }
+  return temp;
+}
 
-f = [n]
-f[0] = 0
-f[1] = 1
-for(var i = 2; i <= 10; i++)
-	f[i] = f[i-2]+f[i-1];
-
-
-for(var i = 0; i <= 10; i++)
-	console.log(f[i])
+fibonacci(7);
diff --git a/NumberConvertions/DecimalToBinary.js b/NumberConvertions/DecimalToBinary.js
diff --git a/SearchAlgorithms/binarySearch.js b/SearchAlgorithms/binarySearch.js
@@ -1,16 +1,14 @@
-function binarySearch(arr, target) {
-  let left = 0;
-  let right = arr.length - 1;
-  while (left <= right) {
-      const mid = left + Math.floor((right - left) / 2);
-      if (arr[mid] === target) {
-          return mid;
-      }
-      if (arr[mid] < target) {
-          left = mid + 1;
+function binarySearch(sortedArray, elementToFind) {
+    var lowIndex = 0;
+    var highIndex = sortedArray.length - 1;
+    while (lowIndex <= highIndex) {
+      var midIndex = Math.floor((lowIndex + highIndex) / 2);
+      if (sortedArray[midIndex] == elementToFind) {
+        return midIndex;
+      } else if (sortedArray[midIndex] < elementToFind) {
+        lowIndex = midIndex + 1;
       } else {
-          right = mid - 1;
+        highIndex = midIndex - 1;
       }
-  }
-  return -1;
-}
+    } return null;
+  }
diff --git a/Strings/Algorithms_toDo.md b/Strings/Algorithms_toDo.md
@@ -4,5 +4,4 @@
 + knutz morris pratt
 + levenshtein distance
 + manacher
-+ min cost string conversion
-+ rabin karp
++ min cost string conversion
