Update quick-sort.asc

Fixing a minor but important detail

book/content/part04/quick-sort.asc

@@ -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 the right and the ones that are bigger to the left. 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 the left and the ones that are bigger to the right. It does this recursively until all the array is sorted.
 
 ===== Quicksort Implementation