Quicksort Tips

Javasper answered on July 26, 2022 Popularity 1/10 Helpfulness 1/10

answer Quicksort Tips

Quicksort Tips

Comment

first use Partition to find the pivot
Then we do two more quicksorts
one with all the element up till one less the pivot position-wise
then the other all the elements from one more the pivot until the end.
during partition
pick the A[low] value as the pivot
move the pointer of left to the -> until you get an element that is greater than your pivot
move the pointer of right to the <- until you get an element that is less than your pivot
so left is lower and right is higher than your pivot.
then swap the left and right
we then set the A[right] element equal to A[low]. The right is the new low of the pivot.
Right is final position for the pivot. 
A[right] is now the new pivot_item.
and Partition return the number value right.

Popularity 1/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: quicksort whatever

Link to this answer
Share Copy Link

Contributed on Jul 26 2022

Javasper

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Quicksort Tips

Contents

More Related Answers

Quicksort Tips

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.