//Examine the elements at subscripts I through J inclusive.

template <size_t I, size_t J>
inline void inner(int *p)
{
	if (p[I + 1] < p[I]) {		//if in wrong order
		const int temp = p[I];	//swap them
		p[I] = p[I + 1];
		p[I + 1] = temp;
	}

	inner<I == J ? 0 : I + 1, I == J ? 0 : J>(p);
}

template <>
inline void inner<0, 0>(int *p) {}

//Sort N elements (subscripts 0 to N-1 inclusive).

template <size_t N>
inline void sort(int *p)
{
	inner<0, N - 1>(p);
	sort<N - 1>(p);
}

template <>
inline void sort<0>(int *p) {}