Nov 14, 2021 · Nov 9, 2021
diff --git a/book/content/part04/quick-sort.asc b/book/content/part04/quick-sort.asc
 indexterm:[Divide and Conquer]
 In practice, quicksort outperforms other sorting algorithms like <<part04-algorithmic-toolbox#merge-sort>>. And, of course, It also outperforms simple sorting algorithms like <<part04-algorithmic-toolbox#selection-sort>>, <<part04-algorithmic-toolbox#insertion-sort>> and <<part04-algorithmic-toolbox#insertion-sort>>.

 Quicksort picks a "pivot" element randomly and moves all the smaller parts than the pivot to theright and the ones that are bigger to theleft. It does this recursively until all the array is sorted.
 Quicksort picks a "pivot" element randomly and moves all the smaller parts than the pivot to theleft and the ones that are bigger to theright. It does this recursively until all the array is sorted.

 =====Quicksort Implementation
Original file line number	Diff line number	Diff line change
Expand Up		@@ -13,7 +13,7 @@ Quicksort is an efficient recursive sorting algorithm that uses <<Divide and Con
		indexterm:[Divide and Conquer]
		In practice, quicksort outperforms other sorting algorithms like <<part04-algorithmic-toolbox#merge-sort>>. And, of course, It also outperforms simple sorting algorithms like <<part04-algorithmic-toolbox#selection-sort>>, <<part04-algorithmic-toolbox#insertion-sort>> and <<part04-algorithmic-toolbox#insertion-sort>>.

		Quicksort picks a "pivot" element randomly and moves all the smaller parts than the pivot to theright and the ones that are bigger to theleft. It does this recursively until all the array is sorted.
		Quicksort picks a "pivot" element randomly and moves all the smaller parts than the pivot to theleft and the ones that are bigger to theright. It does this recursively until all the array is sorted.

		=====Quicksort Implementation

Expand Down