//prototypes 
void Reverse(char *ptrA);
void RecursiveReverse(char *ptrA);

//call in main
Reverse(Array1);
RecursiveReverse(Array2);

/* Reverse the contents of a char array
Input: a pointer to a char array
Output: the contents of the array in reverse order
 */
void Reverse(char *ptrA)
{
   char temp;
   char  *pStart = ptrA;
   char  *pEnd = ptrA;

   while ( *pEnd != NULL)	// assume char *pEnd ends with '\0'
   {
      pEnd ++;				// count the values in the array
   }
   pEnd--;					// determine the proper length of the array because indexes start at zero
   
   while ( pStart < pEnd )	// this loop swaps the values and reverses the array
   {
      temp = *pStart;
      *pStart = *pEnd;
      *pEnd = temp;
      pStart ++;
      pEnd--;
   }

}

/* Reverse the contents of a char array using recusion
Input: a pointer to a char array
Output: the contents of the array in reverse order
 */
void RecursiveReverse(char *ptrA)
{
	char temp;
	int size;
	char *pStart;
	char *pEnd;
	
	pStart = ptrA;
	size = strlen(pStart);
	pEnd = pStart + (strlen(pStart)-1);

	if(pStart >= pEnd)	/* base case */
	{
	return;
	}
	else				//we want to swap
	{
		temp = *pStart;
		*pStart = *pEnd;
		*pEnd = temp;
		pStart = pStart + 1;
		RecursiveReverse(pStart);	/* recursive call */
	}
}

/* prototypes */
void RecursiveReverse(char *ptrA, char *ptrB);

//call in main
RecursiveReverse(Array2, (Array2 + (strlen(Array2) - 1)));

/* Reverse the contents of a char array using recusion
Input: a pointer to a char array and a pointer to the end of that array
Output: the contents of the array in reverse order
 */
void RecursiveReverse(char *ptrA, char *ptrB)
{

    char temp;            //needed for the swap
    char *pStart;        //pointer to start of array
    char *pEnd;            //pointer to end of array

    pStart = ptrA;
    pEnd = ptrB;

    if(pStart >= pEnd)    // base_case if the pointers meet or overlap we're done
    {
    return;
    }
    else                //we want to swap
    {
        temp = *pStart;        //perform the swap
        *pStart = *pEnd;
        *pEnd = temp;        
        pStart++;            //increment the start position
        pEnd--;                //decrement the end position
        RecursiveReverse(pStart, pEnd);        //recursive call with the new pointer values
    }
}