fix heading level 2 text (#36499)
parent
1494a50123
commit
c856fe56bd
|
@ -10,7 +10,7 @@ The steps involved in Quick Sort are:
|
||||||
- Partitioning: Sort the array in such a manner that all elements less than the pivot are to the left, and all elements greater than the pivot are to the right.
|
- Partitioning: Sort the array in such a manner that all elements less than the pivot are to the left, and all elements greater than the pivot are to the right.
|
||||||
- Call Quicksort recursively, taking into account the previous pivot to properly subdivide the left and right arrays. (A more detailed explanation can be found in the comments below)
|
- Call Quicksort recursively, taking into account the previous pivot to properly subdivide the left and right arrays. (A more detailed explanation can be found in the comments below)
|
||||||
|
|
||||||
## Exmaple Implementations in Various Languages
|
## Example Implementations in Various Languages
|
||||||
|
|
||||||
### Implementation in JavaScript:
|
### Implementation in JavaScript:
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue