Sorting Algos

Author: piyush-eon

#7 - Search Algorithm/1-linear-search.js renamed to #7 - Search Algorithms/1-linear-search.js

@@ -0,0 +1,25 @@
+// Ques 1: Implement Bubble Sort in JavaScript
+// Write a function to sort the given array nums in ascending order.
+
+// Input: nums = [29,10,14,37,14] ----->>>>>  Output: [10,14,14,29,37]
+
+const bubbleSort = (arr) => {
+  const n = arr.length;
+  for (let i = 0; i < n; i++) {
+    for (j = 0; j < n - i - 1; j++) {
+      if (arr[j] > arr[j + 1]) {
+        [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]];
+      }
+    }
+  }
+
+  return arr;
+};
+
+console.log(bubbleSort([29, 10, 14, 37, 14]));
+
+// Best Time Complexity = O(n)
+// Worst Time Complexity = O(n^2)
+// Average Time Complexity = O(n^2)
+
+// Space Complexity = O(1)

#7 - Search Algorithm/2-binary-search.js renamed to #7 - Search Algorithms/2-binary-search.js

@@ -0,0 +1,28 @@
+// Ques 2: Implement Selection Sort in JavaScript
+// Write a function to sort the given array nums in ascending order.
+
+// Input: nums = [29,10,14,37,14]  ----->>>>>  Output: [10,14,14,29,37]
+
+const selectionSort = (arr) => {
+  const n = arr.length;
+  for (let i = 0; i < n - 1; i++) {
+    // n
+    let minIndex = i;
+    for (let j = i + 1; j < n; j++) {
+      // n
+      if (arr[j] < arr[minIndex]) {
+        minIndex = j;
+      }
+    }
+    if (minIndex !== i) {
+      [arr[i], arr[minIndex]] = [arr[minIndex], arr[i]];
+    }
+  }
+
+  return arr;
+};
+
+console.log(selectionSort([29, 10, 14, 37, 14]));
+
+// Time Complexity = O(n^2)
+// Space Complexity = O(1)

#7 - Search Algorithm/3-kth-missing-positive-number.js renamed to #7 - Search Algorithms/3-kth-missing-positive-number.js

@@ -0,0 +1,29 @@
+// Ques 3: Implement Insertion Sort in JavaScript
+// Write a function to sort the given array nums in ascending order.
+
+// Input: nums = [29,10,14,37,14,33,8,11] ----->>>>>  Output: [8,10,11,14,14,29,33,37]
+
+function insertionSort(arr) {
+  const n = arr.length;
+
+  for (let i = 1; i < n; i++) {
+    // n
+    const key = arr[i];
+    let j = i - 1;
+    while (j >= 0 && arr[j] > key) {
+      // n
+      arr[j + 1] = arr[j];
+      j--;
+    }
+    arr[j + 1] = key;
+  }
+
+  return arr;
+}
+
+console.log(insertionSort([29, 10, 14, 37, 14, 33, 8, 11]));
+
+// Best Case Time Complexity = O(n)
+// Worst Case Time Complexity = O(n^2)
+// Average Case Time Complexity = O(n^2)
+// Space Complexity = O(1)

#7 - Search Algorithm/4-maximum-count-of-positive-and-negative-integer.js renamed to #7 - Search Algorithms/4-maximum-count-of-positive-and-negative-integer.js

@@ -0,0 +1,34 @@
+// Sort() Method in Javascript
+
+const fruits = ["dragon fruit", "apple", "date", "cherry", "banana"];
+
+console.log(fruits.sort());
+
+const nums = [10, 5, 18, 1, 27];
+
+const compareFunction = (a, b) => {
+  // 1. <0 => a comes first
+  // 2. 0  => nothing changes
+  // 3. >0 => b comes first
+
+  return b - a;
+};
+
+console.log(nums.sort(compareFunction));
+
+const people = [
+  {name: "Piyush", age: 25},
+  {name: "Suyash", age: 22},
+  {name: "Raj", age: 30},
+  {name: "Ishan", age: 27},
+];
+
+const compareFunctionForObj = (a, b) => {
+  // 1. <0 => a comes first
+  // 2. 0  => nothing changes
+  // 3. >0 => b comes first
+
+  return a.age - b.age;
+};
+
+console.log(people.sort(compareFunctionForObj));