This question has already been answered:
It is required to modify the standard quicksort by adding the selection of the dividing element using the median. I do not understand how to do it. Can anybody bring ready C ++ code?
A similar question was asked earlier and an answer has already been received. If the answers provided are not exhaustive, please ask a new question .
Everything is simple - when you choose a support element, you do not need to take it, as usual, first, but take, say, three elements (usually take the first, last, and average by location), compare, and select the middle one of them ( not by location, of course, but by value).
If you brought your quick sort code, it would be easier to show how to modify it. Asking for the finished code here is not comme il faut :)
Source: https://ru.stackoverflow.com/questions/751709/
All Articles