chore: updated implmentation

Author: rupeshtiwari

README.md

@@ -20,8 +20,8 @@
   - [Stack](#stack)
     - [Popping element from stack](#popping-element-from-stack)
   - [Queue](#queue)
-    - [Dequeue an element from Queue](#dequeue-an-element-from-queue)
     - [Enqueue an element in Queue](#enqueue-an-element-in-queue)
+    - [Dequeue an element from Queue](#dequeue-an-element-from-queue)
   - [Tree](#tree)
     - [Binary Tree](#binary-tree)
     - [Binary Search Tree (BST)](#binary-search-tree-bst)
@@ -38,6 +38,7 @@
     - [Merge Sort Algorithm Simulator](#merge-sort-algorithm-simulator)
     - [Implement Merge Sort](#implement-merge-sort)
     - [Find Median Values (With Merge Sort Algorithm)](#find-median-values-with-merge-sort-algorithm)
+  - [Quick Sort](#quick-sort)
   - [BFS (Breath First Search)](#bfs-breath-first-search)
 - [Math & Stats](#math--stats)
   - [Integer Division Without Using \* or /](#integer-division-without-using--or-)
@@ -238,6 +239,16 @@ stack.pop(); // 1 , stack []
 
 Breadth First Search (BFS) uses a `queue` for storing the nodes that it is visiting.
 
+#### Enqueue an element in Queue
+
+```ts
+var queue = [];
+
+queue.push(1); //   queue [1]
+queue.push(2); //   queue [1,2]
+queue.push(3); //   queue [1,2,3]
+```
+
 #### Dequeue an element from Queue
 
 ```ts
@@ -248,16 +259,6 @@ queue.shift(); // 3 , queue [4]
 queue.shift(); // 4 , queue []
 ```
 
-#### Enqueue an element in Queue
-
-```ts
-var queue = [];
-
-queue.unshift(1); //   queue [1]
-queue.unshift(2); //   queue [2,1]
-queue.unshift(3); //   queue [3,2,1]
-```
-
 ### Tree
 
 A tree has hierarchical data and it has nodes.
@@ -385,6 +386,13 @@ So in order to find median we can use the stich algorithm since arrays are alrea
 
 [Exercise File](src/sorting/merge-sort/find-median-values.mjs)
 
+### Quick Sort
+
+![](https://i.imgur.com/LudZhvH.png)
+
+- [Implement Quick Sort Question](https://codepen.io/roopkt/pen/NWpzMRv?editors=0010)
+- [Implement Quick Sort Answer](https://codepen.io/roopkt/pen/eYvKrvP?editors=0010)
+
 ### BFS (Breath First Search)
 
 ## Math & Stats

src/algorithms/sorting/quick-sort/quick-sort.mjs

@@ -0,0 +1,60 @@
+/**
+ * [3,53,5,23]
+ *
+ * p = 23
+ * l = [3,5]
+ * r = [53]
+ * [3,5,23,53]
+ *
+ * arr [3,5], p=5
+ * l = [3]
+ * r = []
+ * [3,5]
+ *
+ * r = 53
+ */
+
+function quickSort(arr) {
+  if (arr.length <= 1) {
+    return arr;
+  }
+  const pivot = arr[arr.length - 1];
+  const [left, right] = splitArray(arr, pivot);
+
+  const leftSorted = quickSort(left);
+  const rightSorted = quickSort(right);
+
+  const finalSorted = [...leftSorted, pivot, ...rightSorted];
+
+  return finalSorted;
+}
+
+function splitArray(arr, pivot) {
+  const left = [];
+  const right = [];
+
+  for (var i = 0; i < arr.length; i++) {
+    let element = arr[i];
+    if (element < pivot) {
+      left.push(element);
+    }
+
+    if (element > pivot) {
+      right.push(element);
+    }
+  }
+  return [left, right];
+}
+
+function trace(result, expected) {
+  console.log('result:' + result);
+  console.log('expected:' + expected);
+}
+
+// Test
+console.log(quickSort([2, 4, 12, 42, 11, 48, 9, 10], 10));
+
+trace(
+  quickSort([2, 4, 12, 42, 11, 48, 9, 10], 10),
+  [2, 4, 9, 10, 11, 12, 42, 48]
+);