Question

Describe the quick sort algorithm using pseudocode.

Short answer

Thus, Return quick sort $\left(L_1\right)$, quicksort $\left(L_2\right)$.

Step-by-step solution

Quick sort splits.

Quick sort splits the given list into a list with all elements less than the first element and a list with all elements greater than the first element.

Step(i) Always select the first element as the pivot.

Step(ii) Always select the last element as the pivot.

Step(iii) Select a random element as a pivot.

Step(iv) Select the median as a pivot.

Solution  

Here, $Quick\hspace{0.33em}sort(a_1,a_2,a_3---a_n:integerwithn\ge 1)$

$$\begin{gathered} L_1:\theta \\ {L}_2:\theta \end{gathered}$$

When the list contains one element then, the quicksort algorithm should return the element itself.

If n = 1

Return.

When the list contains only one element.

Then we create step $L_1$and $L_2$.

Where,

$L_1$contains all elements smaller than.

$L_2$contains all elements smaller than.

else for i = 2 to n.

if $a_i<a_1$.

Then $L_1=L_1\cup \left\{a_i\right\}$

elserole="math" localid="1668595036466" $L_2=L_2\cup \left\{a_i\right\}$

here we add$a_1$ to the end of the first list $L_1$.

Now return the quicksort step.

$L_1=L_1\cup \left\{a_i\right\}$

Return quick sort $\left(L_1\right)$, quicksort $\left(L_2\right)$.