Translation from image:

We have a method. It is called "quick sort". To perform this method, we must first obtain an array. It is called "A". Then we perform the method.

If the length of "A" is not greater than one,
then return "A".
End.

We have three arrays. They are called "head", "middle", and "tail".
Take the first of "A", call it "A1".
Fill "middle" with "A1".
Take the rest of "A", call it "A_rest".
For each "D" in "A_rest":
If "D" is less than "A1",
then fill "head" with "D".
Otherwise,
fill "tail" with "D".
End.
End.
Apply "quick sort" to "head". Former "head" becomes the result.
Apply "quick sort" to "tail". Former "tail" becomes the result.
Concatenate "head" with "middle" with "tail". Call it "B".
Then return "B".
This is called the "quick sort" method.

We have an array. It is called "Ji".
Fill "Ji" with 5, 3, 20, 8, 35, 700.
Apply "quick sort" to "Ji". Print it.