first commit

Author: alguerocode

algorithms/basic-bainary-search.js

@@ -0,0 +1,34 @@
+// bainary search 
+function bainaryWhile(number, sortedArr) {
+  let left = 0;
+  let right = sortedArr.length - 1;
+  let mid;
+  while (left <= right) {
+    mid = Math.floor((left + right) / 2);
+    if (sortedArr[mid] === number) {
+      return true;
+    } else if (sortedArr[mid] > number) {
+      right = mid - 1;
+    } else {
+      left = mid + 1;
+    }
+    console.log(right, left, mid, sortedArr.length)
+  }
+  return false;
+}
+
+//bainary in recursion ;
+function bainarySearch(num, arr) {
+  let mid = Math.floor((arr.length - 1) / 2);
+  console.log(mid, arr.length)
+  if (arr[mid] === num) {
+    return true;
+  } else if (arr[mid] > num) {
+    return bainarySearch(num, arr.slice(0, mid - 1));
+  } else if (arr[mid] < num) {
+    return bainarySearch(num, arr.slice(mid + 1))
+  } else {
+    return false
+  }
+}
+console.log(bainarySearch(1, [1, 3, 3, 3, 3, 3, 3, 4]))

data structure/basic-queue.js

@@ -0,0 +1,67 @@
+class Queue {
+  constructor(fullSize) {
+    this.queue = [];
+    this.rear = -1;
+    this.front = -1;
+    this.arrSize = parseInt(fullSize);
+  }
+  enqueue(item) {
+    if (this.rear === this.arrSize - 1) {
+      console.log('array full');
+      return;
+    }
+    if (this.front = -1) { this.front = 0 };
+    this.rear += 1;
+    this.queue[this.rear] =item;
+    console.log(this.queue, this.front, this.rear);
+  }
+  dequeue() {
+    if (this.arrSize === this.front || this.front === -1) {
+
+      console.log('the queue is empty',this.queue);
+      return;
+    } 
+    this.queue[this.front] = null;
+    if(this.front >= this.rear) {
+      this.rear = -1;
+      this.front = -1;
+    } else {
+      this.front += 1
+    }
+    console.log(this.queue, this.front, this.rear);
+  }
+}
+const newQueue = new Queue(5);
+console.log(newQueue)
+newQueue.enqueue(3);
+newQueue.enqueue(3);
+newQueue.enqueue(3);
+newQueue.enqueue(3);
+newQueue.enqueue(3);
+newQueue.enqueue(3);
+newQueue.dequeue();
+newQueue.dequeue();
+newQueue.dequeue();
+newQueue.dequeue();
+newQueue.dequeue();
+newQueue.dequeue();
+newQueue.dequeue();
+newQueue.dequeue();
+newQueue.dequeue();
+newQueue.dequeue();
+newQueue.enqueue(3);
+newQueue.enqueue(3);
+newQueue.enqueue(3);
+newQueue.dequeue();
+newQueue.dequeue();
+newQueue.dequeue();
+newQueue.dequeue();
+newQueue.dequeue();
+newQueue.enqueue(3);
+newQueue.enqueue(3);
+
+
+
+
+
+