Change returning algorithm

#include <limits.h>
#include <iostream.h>

#define ARRAY_SIZE  200
#define NUM_OF_COINS   3

int g_iCoinVal[] = {1, 4, 5};
int g_iDynMemory[ARRAY_SIZE];

bool CoinExists(int iValue) {
	int iCounter;

	for(iCounter = 0; iCounter < NUM_OF_COINS; iCounter++) {
		if(g_iCoinVal[iCounter] == iValue) {
			return true;
		}
	}

	return false;
}

void DoAlg() {
	int iCounter, iCounter2;

	for(iCounter = 1; iCounter < ARRAY_SIZE; iCounter++) {
		if(CoinExists(iCounter)) {
			g_iDynMemory[iCounter] = 1;
		} else {
			// you only need to know the last coin, that is the coin for which the

			// rest of the amount can be returned in a minimum amount of coins

			int iMin = INT_MAX;

			for(iCounter2 = 0; iCounter2 < NUM_OF_COINS; iCounter2++) {
				if(iCounter - g_iCoinVal[iCounter2] > 0) {
					if(g_iDynMemory[iCounter - g_iCoinVal[iCounter2]] < iMin) {
						iMin = g_iDynMemory[iCounter - g_iCoinVal[iCounter2]] + 1;
					}
				} else {
					break;
				}
			}
			g_iDynMemory[iCounter] = iMin;
			
		}
		cout << iCounter << ": " << g_iDynMemory[iCounter] << endl;
	}
}

int main(int argc, char* argv[])
{
	DoAlg();
	return 0;
}