added quick sort U w U

TamimEhsan · TamimEhsan · commit 455d75e314c4 · 2021-06-12T02:51:54.000+06:00
diff --git a/.idea/dbnavigator.xml b/.idea/dbnavigator.xml
diff --git a/README.md b/README.md
@@ -22,6 +22,7 @@ ALgorithms implemented yet so far are
 - Insertion sort
 - Heap sort
 - Merge sort
+- Quick sort
 - Sieve of Eratosthenes
 - N Queen Backtracking
 - Graham Scan for Convex Hull
diff --git a/src/algorithms/quickSort.js b/src/algorithms/quickSort.js
@@ -0,0 +1,59 @@
+let values = [];
+
+export function quickSort(rects2){
+    let rects = rects2.slice();
+    values = [];
+    let sz = rects2.length;
+    // console.log( "fdsfsd",sz );
+    sz = sz-1;
+    quick(rects,0,sz);
+    for(var i=0;i<=sz;i++){
+        values.push({
+            xx:i,
+            yy:i,
+            changed:true
+        })
+    }
+    return values;
+}
+
+
+function getPartition(rects, left, right){
+    let pivot = rects[right].width
+    let it = left-1;
+    for(var j=left;j<=right-1;j++){
+        if( rects[j].width< pivot){
+            it++;
+            if( it!==j ){
+                // swap(rects[it],rects[j];
+                const rect1 = {...rects[it]};
+                const rect2 = {...rects[j]};
+                rects[it] = rect2;
+                rects[j] = rect1;
+                values.push({
+                    xx:it,
+                    yy:j,
+                    changed:true
+                })
+            }
+        }
+    }
+    if( it+1!==right ){
+        const rect1 = {...rects[it+1]};
+        const rect2 = {...rects[right]};
+        rects[it+1] = rect2;
+        rects[right] = rect1;
+        values.push({
+            xx:it+1,
+            yy:right,
+            changed:true
+        })
+    }
+    return it+1;
+}
+function quick(rects,left,right){
+    if( left>=right ) return ;
+    const partition = getPartition(rects,left,right);
+    quick(rects,left,partition-1);
+    quick(rects,partition+1,right);
+}
diff --git a/src/algorithms/quickSortRecursive.js b/src/algorithms/quickSortRecursive.js
@@ -0,0 +1,60 @@
+let values = [];
+
+export function quickSortRecursive(rects2){
+    let rects = rects2.slice();
+    values = [];
+    let sz = rects2.length;
+    // console.log( "fdsfsd",sz );
+    sz = sz-1;
+    quick(rects,0,sz);
+    return values;
+}
+
+
+function getPartition(rects, left, right){
+    values.push({
+        left,
+        right,
+        swap:false,
+        changedRange:true,
+    })
+    let pivot = rects[right].width
+    let it = left-1;
+    for(var j=left;j<=right-1;j++){
+        if( rects[j].width< pivot){
+            it++;
+            if( it!==j ){
+                // swap(rects[it],rects[j];
+                const rect1 = {...rects[it]};
+                const rect2 = {...rects[j]};
+                rects[it] = rect2;
+                rects[j] = rect1;
+                values.push({
+                    left:it,
+                    right:j,
+                    swap:true,
+                    changedRange:false,
+                })
+            }
+        }
+    }
+    if( it+1!==right ){
+        const rect1 = {...rects[it+1]};
+        const rect2 = {...rects[right]};
+        rects[it+1] = rect2;
+        rects[right] = rect1;
+        values.push({
+            left:it+1,
+            right:right,
+            swap:true,
+            changedRange:false,
+        })
+    }
+    return it+1;
+}
+function quick(rects,left,right){
+    if( left>=right ) return ;
+    const partition = getPartition(rects,left,right);
+    quick(rects,left,partition-1);
+    quick(rects,partition+1,right);
+}
diff --git a/src/recursiveSortComponents/rect.jsx b/src/recursiveSortComponents/rect.jsx
@@ -7,8 +7,11 @@ class Rect extends Component {
             <div
                 className='rect'
                 style={{height:this.props.rect.width,
+                    border: this.checkBorder(),
                     background:this.checkColor(),
                     margin:this.props.marg
+
+
                 }}
             >
                 
@@ -28,6 +31,13 @@ class Rect extends Component {
             return "#ADD8E6";
         }
     }
+    checkBorder = () =>{
+        if( this.props.rect.isRange ){
+            return "0px solid black";
+        } else{
+            return "0px"
+        }
+    }
 }
 
 export default Rect;
diff --git a/src/recursiveSortComponents/recursiveSort.js b/src/recursiveSortComponents/recursiveSort.js
@@ -3,6 +3,7 @@ import Rect from "./rect";
 import Rects from "./rects";
 import mergeSort from '../algorithms/mergeSort';
 import heapSort from "../algorithms/heapSort";
+import {quickSortRecursive} from "../algorithms/quickSortRecursive";
 import Navbar from "./navbar";
 import Menu from "./menu";
 
@@ -83,24 +84,93 @@ class RecursiveSort extends Component {
 
         this.setState({isRunning: true});
         let steps;
+        let rects2;
         switch (this.state.algo) {
+
             case 0:
                 steps = mergeSort(this.state.rects);
                 this.handleMerge(steps);
                 break;
             case 1:
-                const rects2 = this.state.rects.slice();
+                rects2 = this.state.rects.slice();
                 steps = heapSort(rects2);
                 this.handleHeap(steps);
                 break;
+            case 2:
+                rects2 = this.state.rects.slice();
+                steps = quickSortRecursive(rects2);
+                this.handleQuick(steps);
+                break;
             default:
         }
 
 
     }
+
+    handleQuick = async (steps) =>{
+        this.setState({isRunning: true});
+        let prevRect = this.state.rects;
+        for (let j = 0; j < this.state.count; j++) {
+            prevRect[j] = {...prevRect[j], isLeft: false,isSorting: false,isRight:false,isRange:false,isSorted: false};
+        }
+        this.setState({rects: prevRect});
+        let hasChanged = -1;
+        let changed;
+        for(let i=0;i<steps.length;i++){
+            let step = steps[i];
+            if( hasChanged!==-1 ){
+                let {left,right} = changed;
+                prevRect[left] = {...prevRect[left], isLeft: false,isSorting: false,isRight:false,isRange:false};
+                prevRect[right] = {...prevRect[right], isLeft: false,isSorting: false,isRight:false,isRange:false};
+            }
+            if( step.changedRange ){
+                await sleep(this.state.speed);await sleep(this.state.speed);await sleep(this.state.speed);await sleep(this.state.speed);
+                let {left,right} = step;
+                for (let j = 0; j < this.state.count; j++) {
+                    prevRect[j] = {...prevRect[j], isLeft: false,isSorting: false,isRight:false,isRange:false};
+                }
+                for (let j = left; j <=right; j++) {
+                    prevRect[j] = {...prevRect[j], isLeft: false,isSorting: false,isRight:true,isRange:true};
+                }
+                this.setState({rects: prevRect});
+                await sleep(this.state.speed);await sleep(this.state.speed);await sleep(this.state.speed);await sleep(this.state.speed);
+                for (let j = 0; j < this.state.count; j++) {
+                    prevRect[j] = {...prevRect[j], isLeft: false,isSorting: false,isRight:false};
+                }
+            }else if(step.swap){
+                let {left,right} = step;
+                prevRect[left] = {...prevRect[left], isLeft: false,isSorting: true,isRight:false,isRange:false};
+                prevRect[right] = {...prevRect[right], isLeft: true,isSorting: false,isRight:false,isRange:false};
+                let temp = prevRect[left];
+                prevRect[left] = prevRect[right];
+                prevRect[right] = temp;
+                hasChanged = 1;
+                changed = step;
+            }
+            this.setState({rects: prevRect});
+            await sleep(this.state.speed);
+            if (i === steps.length - 1) {
+                for (let j = 0; j < this.state.count; j++) {
+                    prevRect[j] = {...prevRect[j], isLeft: false,isSorting: false,isRight:false,isSorted: false,isRange:false};
+                }
+                this.setState({rects: prevRect});
+                for (let j = 0; j < this.state.count; j++) {
+                    prevRect[j] = {...prevRect[j], isLeft: false,isSorting: false,isRight:false,isSorted: true,isRange:false};
+                    this.setState({rects: prevRect});
+                    await sleep(10);
+                }
+                this.setState({isRunning: false,rects: prevRect});
+            }
+        }
+    }
     handleHeap = async (steps) =>{
         this.setState({isRunning: true});
         let prevRect = this.state.rects;
+        for (let j = 0; j < this.state.count; j++) {
+            prevRect[j] = {...prevRect[j], isLeft: false,isSorting: false,isRight:false,isRange:false,isSorted: false};
+        }
+        this.setState({rects: prevRect});
+
         for(let i = 0;i<steps.length;i++){
             let step = steps[i];
             //   console.log(step);
@@ -117,7 +187,7 @@ class RecursiveSort extends Component {
             prevRect[right] = temp;
             this.setState({rects: prevRect});
             if( sorted ) prevRect[left] = {...prevRect[left],isSorted: true};
-            await sleep(this.state.speed);
+            await sleep(this.state.speed);await sleep(this.state.speed);await sleep(this.state.speed);
             if (i === steps.length - 1) {
 
                 for (let i = 0; i < this.state.count; i++) {
@@ -131,9 +201,15 @@ class RecursiveSort extends Component {
     }
     handleMerge = async (steps) => {
         this.setState({isRunning1: true});
+
         const {speed} = this.state;
 
         let prevRect = this.state.rects;
+        for (let j = 0; j < this.state.count; j++) {
+            prevRect[j] = {...prevRect[j], isLeft: false,isSorting: false,isRight:false,isRange:false,isSorted: false};
+        }
+        this.setState({rects: prevRect});
+        await sleep(this.state.speed);
       //  console.log("steps ", steps.length);
         for (let ii = 0; ii < steps.length; ii++) {
             let step = steps[ii];
diff --git a/src/recursiveSortComponents/simpleSelect.jsx b/src/recursiveSortComponents/simpleSelect.jsx
@@ -40,6 +40,7 @@ const SimpleSelect = (props) => {
                 >
                     <MenuItem value={0} style={{selected:true}} >Merge Sort</MenuItem>
                     <MenuItem value={1} style={{selected:true}} >Heap Sort</MenuItem>
+                    <MenuItem value={2} style={{selected:true}} >Quick Sort</MenuItem>
                 </Select>
             </FormControl>
         </div>
diff --git a/src/sortComponents/simpleSelect.jsx b/src/sortComponents/simpleSelect.jsx
@@ -41,6 +41,7 @@ const SimpleSelect = (props) => {
                     <MenuItem value={0} style={{selected:true}} >Bubble Sort</MenuItem>
                     <MenuItem value={1}>Selection Sort</MenuItem>
                     <MenuItem value={2}>Insertion Sort</MenuItem>
+                    <MenuItem value={3}>Quick Sort</MenuItem>
                 </Select>
             </FormControl>
         </div>
diff --git a/src/sortComponents/sort.js b/src/sortComponents/sort.js
@@ -2,6 +2,7 @@ import React, {Component} from 'react';
 import Rect from "./rect";
 import Rects from "./rects";
 import {bubbleSort,selectionSort,insertionSort} from "../algorithms/sortingAlgorithms";
+import {quickSort} from "../algorithms/quickSort";
 import Navbar from "./navbar";
 import Menu from "./menu";
 
@@ -102,6 +103,10 @@ class Sort extends Component {
           case 2:
               steps1 = insertionSort(this.state.rects);
               break;
+          case 3:
+              steps1 = quickSort(this.state.rects2);
+              console.log(steps1)
+              break;
           default:
               steps1 = bubbleSort(this.state.rects);
               break;
@@ -119,6 +124,9 @@ class Sort extends Component {
               case 2:
                   steps2 = insertionSort(this.state.rects2);
                   break;
+              case 3:
+                  steps2 = quickSort(this.state.rects2);
+                  break;
               default:
                   steps2 = bubbleSort(this.state.rects2);
                   break;

Original file line number	Diff line number	Diff line change
`@@ -7,8 +7,11 @@ class Rect extends Component {`
`7`	`7`	`<div`
`8`	`8`	`className='rect'`
`9`	`9`	`style={{height:this.props.rect.width,`
	`10`	`+ border: this.checkBorder(),`
`10`	`11`	`background:this.checkColor(),`
`11`	`12`	`margin:this.props.marg`
	`13`	`+`
	`14`	`+`
`12`	`15`	`}}`
`13`	`16`	`>`
`14`	`17`
`@@ -28,6 +31,13 @@ class Rect extends Component {`
`28`	`31`	`return "#ADD8E6";`
`29`	`32`	`}`
`30`	`33`	`}`
	`34`	`+ checkBorder = () =>{`
	`35`	`+ if( this.props.rect.isRange ){`
	`36`	`+ return "0px solid black";`
	`37`	`+ } else{`
	`38`	`+ return "0px"`
	`39`	`+ }`
	`40`	`+ }`
`31`	`41`	`}`
`32`	`42`
`33`	`43`	`export default Rect;`
Original file line number	Diff line number	Diff line change
`@@ -40,6 +40,7 @@ const SimpleSelect = (props) => {`
`40`	`40`	`>`
`41`	`41`	`<MenuItem value={0} style={{selected:true}} >Merge Sort</MenuItem>`
`42`	`42`	`<MenuItem value={1} style={{selected:true}} >Heap Sort</MenuItem>`
	`43`	`+ <MenuItem value={2} style={{selected:true}} >Quick Sort</MenuItem>`
`43`	`44`	`</Select>`
`44`	`45`	`</FormControl>`
`45`	`46`	`</div>`