#include <iostream>
using namespace std;

const int CAPACITY=100;

// Create and return a char array of the given size, fill the array with
// value 100
int * MakeArray (int size); 

int * MakeArrayCorrect (int size); 


int main()
{
	int length;

	cout <<"How large is the array? ";
	cin >> length;

	int * a;
	a = MakeArray (length);

	cout <<"In main: array of length" << length <<endl;
	for (int i=0;i<length;i++)
		cout << a[i]<<endl;
	cout <<"DONE\n";


	
	int * b;
	b = MakeArrayCorrect (length);

	cout <<"In main: array of length" << length <<endl;
	for (int i=0;i<length;i++)
		cout << b[i]<<endl;
	cout <<"DONE\n";
}


int * MakeArrayCorrect (int size)
{
	int * Array;
	int i;

	Array = new int[size];	// Array is pointing to a memory dynamically allocated (in heap, i.e., freestore). 
			// the memory will be there for as long as we like, i.e., until we free it 

	for (i=0;i<size;i++)
		Array[i] = 100;

	cout <<"In function:\n";
	for (int i=0;i<size;i++)
		cout << Array[i] << endl;
	cout << "DONE\n"; 

	return Array;	// So we can return the address of this array ... 

}

// This function demonstrates a WRONG way to return an array
int * MakeArray (int size)
{
	int Array[CAPACITY];	// Array is a LOCAL variable (it's located in call stack frame).
				// when the function returns, it's gone .... 
	int i;

	for (i=0;i<size;i++)
		Array[i] = 100;

	cout <<"In function:\n";
	for (int i=0;i<size;i++)
		cout << Array[i] << endl;
	cout << "DONE\n"; 

	return Array;	// We are returning address of a piece of memory that will be gone in a second 

}