Adding Bubble, Insertion & Selection Sort

Vishal-raj-1 · Vishal-raj-1 · commit ba69d9d2caac · 2023-08-19T23:48:17.000+05:30
diff --git a/README.md b/README.md
@@ -29,4 +29,5 @@
 - [String](https://github.com/Vishal-raj-1/DSA-In-JS-With-Vishal/blob/main/String/README.md)
 - [Recursion](https://github.com/Vishal-raj-1/DSA-In-JS-With-Vishal/blob/main/Recursion/README.md)
 - [Linear & Binary Search](https://github.com/Vishal-raj-1/DSA-In-JS-With-Vishal/blob/main/Searching%20Algorthims/README.md)
-- [Objects](https://github.com/Vishal-raj-1/DSA-In-JS-With-Vishal/blob/main/Objects/README.md)
+- [Objects](https://github.com/Vishal-raj-1/DSA-In-JS-With-Vishal/blob/main/Objects/README.md)
+- [Sorting](https://github.com/Vishal-raj-1/DSA-In-JS-With-Vishal/blob/main/Sorting/README.md)
diff --git a/Sorting/README.md b/Sorting/README.md
@@ -0,0 +1,79 @@
+# Sorting In JavaScript
+
+<p align="center">
+  <a href="https://youtube.com/live/FAPg2VM6N9I">
+  <img src="https://img.youtube.com/vi/FAPg2VM6N9I/0.jpg" alt="Sorting In JavaScript" />
+  </a>
+</p>
+
+### Sort an Array
+```javascript
+const arr = [-2, -7, 1000, 5]
+console.log(arr.sort()) // -2, -7, 1000, 5
+console.log(arr.sort((a, b) => a - b)) // -7, -2 , 5, 1000
+console.log(arr.sort((a, b) => b - a)) // 1000, 5, -2, -7
+
+const strArr = ["mango", "apple", "banana"]
+console.log(strArr.sort()) // "apple", "banana", "mango"
+```
+
+### Sort a String
+```javascript
+const str = "Vishal"
+console.log(str.split("").sort().join("")) // "Vahils
+```
+
+### Bubble Sort In JavaScript
+```javascript
+const bubbleSort = (arr) => {
+    let swapped;
+    do {
+        swapped = false;
+        for (let i = 0; i < arr.length - 1; i++) {
+            if (arr[i] > arr[i + 1]) {
+                [arr[i], arr[i + 1]] = [arr[i + 1], arr[i]]
+                swapped = true;
+            }
+        }
+    } while (swapped)
+    return arr;
+}
+
+console.log(bubbleSort(arr)) // -7, -2 , 5, 1000
+```
+
+### Selection Sort in JavaScript
+```javascript
+const selectionSort = (arr) => {
+    for (let i = 0; i < arr.length - 1; i++) {
+        let minIndex = i;
+        for (let j = i + 1; j < arr.length; j++) {
+            if (arr[j] < arr[minIndex]) {
+                minIndex = j;
+            }
+        }
+        [arr[minIndex], arr[i]] = [arr[i], arr[minIndex]]
+    }
+    return arr;
+}
+
+console.log(selectionSort(arr)) // -7, -2 , 5, 1000
+```
+
+### Insertion Sort In JavaScript
+```javascript
+const insertionSort = (arr) => {
+    for(let i=1; i<arr.length; i++){
+        let current = arr[i];
+        let j = i-1;
+        while(j >= 0 && arr[j] > current){
+            arr[j+1] = arr[j];
+            j--;
+        }
+        arr[j+1] = current;
+    }
+    return arr;
+}
+
+console.log(insertionSort(arr)) // -7, -2 , 5, 1000
+```
diff --git a/Sorting/index.js b/Sorting/index.js
@@ -0,0 +1,73 @@
+// Sorting In JavaScript
+
+// Sort an Array
+const arr = [-2, -7, 1000, 5]
+console.log(arr.sort((a, b) => a - b))
+console.log(arr.sort((a, b) => b - a))
+
+const strArr = ["mango", "apple", "banana"]
+console.log(strArr.sort())
+
+// Sort a String
+const str = "Vishal"
+
+// Ascii value of A = 65 & a = 97
+console.log(str.split("").sort().join(""))
+
+// Bubble Sort In JavaScript
+
+const bubbleSort = (arr) => {
+    let swapped, swapCount = 0;
+    do {
+        swapped = false;
+        for (let i = 0; i < arr.length - 1; i++) {
+            if (arr[i] > arr[i + 1]) {
+                // let temp = arr[i];
+                // arr[i] = arr[i+1];
+                // arr[i+1] = temp;
+                [arr[i], arr[i + 1]] = [arr[i + 1], arr[i]]
+                swapped = true;
+                swapCount++;
+            }
+        }
+    } while (swapped)
+    console.log(swapCount)
+    return arr;
+}
+
+console.log(bubbleSort(arr))
+
+// Selection sort in JavaScript
+
+const selectionSort = (arr) => {
+    for (let i = 0; i < arr.length - 1; i++) {
+        let minIndex = i;
+        for (let j = i + 1; j < arr.length; j++) {
+            if (arr[j] < arr[minIndex]) {
+                minIndex = j;
+            }
+        }
+        [arr[minIndex], arr[i]] = [arr[i], arr[minIndex]]
+    }
+    return arr;
+}
+
+console.log(selectionSort(arr))
+
+// Insertion Sort In JavaScript
+
+const insertionSort = (arr) => {
+    for(let i=1; i<arr.length; i++){
+        let current = arr[i];
+        let j = i-1;
+        while(j >= 0 && arr[j] > current){
+            arr[j+1] = arr[j];
+            j--;
+        }
+        arr[j+1] = current;
+    }
+    return arr;
+}
+
+console.log(insertionSort(arr))
+
