Added few more algorithms

Author: devcer

BubbleSort.js

@@ -0,0 +1,16 @@
+function sort(arr) {
+    for(let i = 0; i < arr.length ; i++) {
+        for(let j = 0; j < arr.length - i; j++) {
+            if(arr[j] > arr[j+1]) {
+                let temp = arr[j];
+                arr[j] = arr[j+1];
+                arr[j+1] = temp;
+            }
+        }
+    }
+    return arr;
+}
+
+// Bubble Sort Time complexity-	Ω(n)	θ(n^2)	O(n^2)
+// space - O(1)
+console.log(sort([14, 33, 27, 35, 10]));

CustomApply.js

@@ -0,0 +1,19 @@
+let person = {
+	firstname: 'tom',
+	lastname: 'harris',
+	getFullName: function() {
+		return `${this.firstname} ${this.lastname}`;
+	}
+}
+function log(job , title) {
+	console.log(`FullName: ${title} ${this.getFullName()}, ${job}`);
+}
+
+log.apply(person, ['Engineer', 'Mr.']);
+
+Function.prototype.myapply = function(obj) {
+  let args = Array.from(arguments)[1];
+	obj.func = this;
+	return obj.func(...args);
+}
+log.myapply(person, ['Engineer', 'Mr.']);

CustomBind.js

@@ -0,0 +1,23 @@
+let person = {
+	firstname: 'tom',
+	lastname: 'harris',
+	getFullName: function() {
+		return `${this.firstname} ${this.lastname}`;
+	}
+}
+function log() {
+	console.log(`FullName: ${this.getFullName()}`);
+}
+// log(); // throws error;
+let newLog = log.bind(person);
+newLog();
+// console.log(person.getFullName());
+
+Function.prototype.mybind = function(obj) {
+	let func = this;
+	return function() {
+		func.call(obj);
+	}
+}
+let myNewlog = log.mybind(person);
+myNewlog();

CustomCall.js

@@ -0,0 +1,19 @@
+let person = {
+	firstname: 'tom',
+	lastname: 'harris',
+	getFullName: function() {
+		return `${this.firstname} ${this.lastname}`;
+	}
+}
+function log(job , title) {
+	console.log(`FullName: ${title} ${this.getFullName()}, ${job}`);
+}
+
+log.call(person, 'Engineer', 'Mr.');
+
+Function.prototype.mycall = function(obj) {
+  let args = Array.from(arguments).slice(1);
+	obj.func = this;
+	return obj.func(...args);
+}
+log.mycall(person, 'Engineer', 'Mr.');

CustomFilter.js

@@ -0,0 +1,14 @@
+Array.prototype.myfilter = function (func) {
+  let arr = this;
+  let newArr = [];
+  for (let i = 0; i < arr.length; i++) {
+    if (func(arr[i])) {
+      newArr.push(arr[i]);
+    }
+  }
+  return newArr;
+};
+
+// let newArr = [1, 2, 3, 4, 5, 6, 7, 8].filter((x) => x % 2 === 0);
+let newArr = [1, 2, 3, 4, 5, 6, 7, 8].myfilter((x) => x % 2 === 0);
+console.log(newArr);

CustomMap.js

@@ -0,0 +1,12 @@
+Array.prototype.mymap = function (func) {
+    let arr = this;
+    let newArr = [];
+    for(let i = 0; i< arr.length; i++) {
+        newArr.push(func(arr[i]));
+    }
+    return newArr;
+};
+// let newArr = [1, 2, 3].map((x) => x * 2);
+// console.log(newArr);
+let newArr = [1, 2, 3].mymap((x) => x * 2);
+console.log(newArr);

CustomReduce.js

@@ -0,0 +1,13 @@
+Array.prototype.myreduce = function (func) {
+  let arr = this;
+  let accum = 0;
+  for (let i = 0; i < arr.length; i++) {
+    accum = func(accum, arr[i]);
+  }
+  return accum;
+};
+
+// let result = [1, 2, 3].reduce((a, b) => a + b);
+let result = [1, 2, 3].myreduce((a, b) => a + b);
+
+console.log(result);

Debounce.js

@@ -0,0 +1,14 @@
+function debounce(func, delay) {
+    let timeout = null;
+    return function() {
+        let context = this;
+        clearTimeout(timeout);
+        timeout = setTimeout(function() {
+            func.call(context);
+        }, delay);
+    }
+}
+
+document.body.addEventListener('click', debounce( function() {
+    console.log("This should be executed");
+}, 2000));

InsertionSort.js

@@ -0,0 +1,16 @@
+function sort(arr) {
+  for (let i = 1; i < arr.length; i++) {
+    let index = i;
+    while (arr[index] < arr[index-1] && index > 0) {
+      let temp = arr[index];
+      arr[index] = arr[index-1];
+      arr[index-1] = temp;
+      index -= 1;
+    }
+  }
+  return arr;
+}
+// Insertion Sort Time complexity-	Ω(n)	θ(n^2)	O(n^2)
+// space - O(1)
+console.log(sort([14, 33, 27, 10, 35, 19, 42, 44]));
+console.log(sort([3, 2, 1, 4]));

SelectionSort.js

@@ -0,0 +1,21 @@
+function sort(arr) {
+  for (let i = 0; i < arr.length; i++) {
+    let elem = arr[i],
+      index = i;
+    for (let j = i + 1; j < arr.length; j++) {
+      if (arr[j] < elem) {
+        elem = arr[j];
+        index = j;
+      }
+    }
+    if (elem !== arr[i]) {
+      arr[index] = arr[i];
+      arr[i] = elem;
+    }
+  }
+  return arr;
+}
+// Selection Sort Time complexity-	Ω(n)	θ(n^2)	O(n^2)
+// space - O(1)
+console.log(sort([14, 33, 27, 10, 35, 19, 42, 44]));
+console.log(sort([3, 2, 1, 4]));

Throttle.js

@@ -0,0 +1,17 @@
+function throttle(func, limit) {
+    let shouldCall = true;
+    return function() {
+        let context = this;
+        let args = arguments;
+        if(shouldCall) {
+            func.call(context, args);
+            shouldCall = false;
+            setTimeout(() => shouldCall = true, limit);
+        }
+    }
+}
+
+
+document.body.addEventListener('click', throttle( function() {
+    console.log("This should be executed");
+}, 2000));

this.js

@@ -0,0 +1,9 @@
+function log() {
+    let color = "orange";
+    return function() {
+        console.log(this.color);
+    } 
+}
+log()();
+let logCopy = log().bind({color: "blue"});
+logCopy();