|
47 | 47 | - [Depth First Search (DFS)](#depth-first-search-dfs)
|
48 | 48 | - [Algorithms Q&A](#algorithms-qa)
|
49 | 49 | - [Merge Sort](#merge-sort)
|
50 |
| - - [Merge Sort Implementation](#merge-sort-implementation) |
51 |
| - - [Find Median Values (With Merge Sort Algorithm)](#find-median-values-with-merge-sort-algorithm) |
52 | 50 | - [Quick Sort](#quick-sort)
|
| 51 | + - [Find Median Values (With Merge Sort Algorithm)](#find-median-values-with-merge-sort-algorithm) |
| 52 | + - [Quick Sort](#quick-sort-1) |
53 | 53 | - [Quick Sort Implementation](#quick-sort-implementation)
|
54 | 54 | - [Math & Stats](#math--stats)
|
55 | 55 | - [Integer Division Without Using \* or /](#integer-division-without-using--or-)
|
@@ -470,15 +470,35 @@ https://www.youtube.com/watch?v=UxnyImctVzg
|
470 | 470 |
|
471 | 471 | 
|
472 | 472 |
|
473 |
| -#### Merge Sort Implementation |
474 |
| - |
475 | 473 | Merge Sort Implementation Visualization:
|
476 | 474 |
|
477 | 475 | [](https://www.youtube.com/watch?v=UxnyImctVzg 'Merge Sort Algorithm Simulator')
|
478 | 476 |
|
479 | 477 | - [Merge Sort Implementation Question](https://codepen.io/roopkt/pen/ExWRRgP?editors=0010)
|
480 | 478 | - [Merge Sort Implementation Answer](https://codepen.io/roopkt/pen/ZEeMPPL?editors=0010)
|
481 | 479 |
|
| 480 | +### Quick Sort |
| 481 | + |
| 482 | +**Quick sort Algorithm** |
| 483 | + |
| 484 | + |
| 485 | + |
| 486 | +**Pseudo Code for Quick Sort Algorithm** |
| 487 | + |
| 488 | + |
| 489 | + |
| 490 | +**Quick Sort Algorithm Simulation** |
| 491 | + |
| 492 | + |
| 493 | + |
| 494 | +**Quick Sort Partition Algorithm** |
| 495 | + |
| 496 | + |
| 497 | + |
| 498 | +**Quick Sort Partition Algorithm Simulation** |
| 499 | + |
| 500 | + |
| 501 | + |
482 | 502 | #### Find Median Values (With Merge Sort Algorithm)
|
483 | 503 |
|
484 | 504 | 2 sorted arrays find the median element. Median is the middle index its not an average of values in an sorted array.
|
|
0 commit comments