In: Computer Science
We saw that Quicksort actually won’t be “quick” when it attempts to sort some types of inputs (e.g., it will take O(n2) time to sort n numbers that are already sorted). List two different ways to improve Quicksort so that it will run “quickly” (on average, in linear time) regardless of the characteristics of the input pattern.
Dear Student I understand your problem and will give you most of the information about different ways to improve Quicksort so that it will run “quickly”.Please go through the information given below and try to interpret with the given information you will surely get the best answer possible.
The quicksort calculation is effortlessly parallelized. On the off chance that you have different centers to work with, you could see a lot of accelerate. Contingent upon how enormous your informational collection is, it could undoubtedly give you more accelerate than some other improvement. In any case, in the event that you have just a single processor or a moderately little informational index, there won't be a very remarkable accelerate.
I could expand more if this is a chance.
OR probably expanding and giving you a simplest explanation with the possible ways......
Dear Student by these explanation and the points mentioned I hope your question is answered .Hope you like it.