Idea of quick Sorting Algorithm

Quick sorting is easy to understand.

A row of Columns 5 6 4 3 7 8 10

Define a variable to save the first number of values

Then, set the initial value of two variables, I = 0 J = the length of the series.

I <j hour

Do

J --

Each number is compared with the first value.

Find the first stop that is smaller than the first one.

Change location with the first number

Do

I ++

Each number is compared with the first value.

Find the first stop that is larger than the first one.

Change location with the first number

I = J.