Description: The questions require read n integers and then outputs the median of n integers. The number of simultaneous input number is odd, when the median is unique when the input number is the number that is even in the time of two of the median average and then rounded down output. In general, we can use these numbers exist among the array, and then sort the array, and finally look to take advantage of the array subscript. But can not sort to find the median. After all, all the numbers are sorted is the right place, while the median lookup operation simply the median in the right location. Find below the median is not the sort version. In fact, the following solution is actually a variant of quicksort. In the case where n is odd, the following run-time code to achieve rapid discharge operation time, since it is divided into two parts each time the array is processed only after a part of it.
To Search:
File list (Check if you may need any files):
TextFile1.txt
Download