int number [] = {8, 5, 6, 3, 7, 4, 1, 2};

int number [] = {8, 5, 6, 3, 7, 4, 2, 2};

#ifndef COUNTINGSORT
#define COUNTINGSORT

namespace mystd
{
	int Min(int number[], int size)
	{
		int min = number[0];
		for (int loop=1;loop<size;++loop)
		{
			if (number[loop] < min)
			{
				min = number[loop];
			}
		}

		return min;
	}

	int Max(int number[], int size)
	{
		int max = number[0];
		for (int loop=1;loop<size;++loop)
		{
			if (number[loop] > max)
			{
				max = number[loop];
			}
		}

		return max;
	}


	template <typename T>
	void CountingSort(T *sortee, int);


	// Specialized version of CS
	template <>
	void CountingSort <int>(int number [], int size)
	{
		int minValue = number[0], maxValue = number[0];
		
		minValue = Min(number, size);
		maxValue = Max(number, size);

		int tempSize = maxValue - minValue + 1;
		int *countingTemp = new int[tempSize];

		for (int loop=0;loop<tempSize;++loop)
		{
			*(countingTemp + loop) = 0;
		}

		// Put count in CountingTemp
		for (int loop=0;loop<size;++loop)
		{
			++countingTemp[number[loop] - minValue];
		}

		tempSize = size - 1;
		int anotherLoop = size - 1;
		while(tempSize >= 0)
		{
			while(--(*(countingTemp + tempSize)) >= 0)
			{
				if (anotherLoop >= 0)
				{
					number[anotherLoop--] = tempSize + 1;
				}
			}
			--tempSize;	
		}

		delete [] countingTemp;
	}
}




#endif

#include <iostream>
using namespace std;

int main(void)   /* note: the indice specifier in number2 is larger than specified elements */
{                  
  int number[]  = {8, 5, 6, 3, 7, 4, 1, 2, 0, 0 };  
  int number2[20] = {8, 5, 6, 3, 7, 4, 1, 2, 0, 0, 0, 0, 0}; 
  cout << "sizeof(number)= "<< sizeof(number) <<"    sizeof(number2)= "<< sizeof(number2) <<endl;
  return 0;
}
/* output:
sizeof(number)= 40    sizeof(number2)= 80
*/