Quicksort median

[louboulos]

Hello. I have an excercise that asks the following:
Consider a modification to QuickSort, such that each time "Partition" is called, the median of the portioned array is found and used as a pivot. Write a pseudocode fo that.

I'm not asking for the answer. I just want to know what the median is. Is it the number that splits the array in half?
i.e: In case of (1,2,3,4,5,6,7,8,9) the median is 5?
Thank you.

[JosAH]

Read this link.

kind regards,

Jos

[louboulos]

can someone else explain please what does the exercise want?

[JosAH]

can someone else explain please what does the exercise want?

Have you read the link I gave you?

kind regards,

Jos

[louboulos]

yeah but I dont get much... :)

[JosAH]

yeah but I dont get much... :)

Don't just skim over it but study the material; there's even very clear pseudo code in there. We are not going to spoonfeed you ...

kind regards,

Jos

[pbrockway2]

I just want to know what the median is. Is it the number that splits the array in half?

Yes, more or less. For the precise definition read the "median" link in the second sentence of the Wikipedia article you have already been pointed at.