#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
//return the median in range[begin,end)
template <class Q>
Q median(Q* begin,Q* end)
{
	std::sort(begin,end);
	Q* mid=(end-begin)/2+begin;		//end-begin is the number of elements
	return (end-begin)%2==0?(*mid+*(mid-1))/2: *mid;		
}

int main()
{	
	double numbers[]={7,2,5,6,3,4,1,9,8};
	double *p=numbers,*q=numbers+sizeof(numbers)/sizeof(*numbers);

	vector<double> num(p,q);
	for(vector<double>::size_type i=0;i<num.size();++i)
		cout<<num[i]<<"  ";
	cout<<endl;
	
	cout<<median(p,q)<<endl;
	cout<<median(num.begin(),num.end())<<endl;


	return 0;
}