Pointers, Dynamic Memory Allocation

1. Dynamic Integer Array. Study Observing Variables feature of MSVS described here. As you work on the below project, demonstrate to the instructor displaying local variable values with "Autos" and "Locals" tab.

   Create a project titled Lab10_DynamicInt. Write a program that dynamically stores and then prints the array of user-input integers. Your program should ask the user for the number of integers to be entered. Then the program should allocate the appropriate-size array dynamically, store the integers and then print them out. You should use this template for your program. Here is an example dialog of your program:

   Enter number of integers: 5
   Enter integers: -3 -4 6 7 23
   You entered: -3 -4 6 7 23
   

2. Variable Size Array. Create a project titled Lab10_VarArray. Write a program that allows the user to add or remove an integer number to a collection of integers and then prints all of them them in the increasing order. You can assume that the user never enters the same number twice. First, the user inputs a letter for the operation: (a)dd, (r)emove or (q)uit; then the number.

   Here is an example program dialog:

   enter operation [a/r/q] and number: a 5
   your numbers: 5
   enter operation [a/r/q] and number: a 8
   your numbers: 5 8
   enter operation [a/r/q] and number: r 8
   your numbers: 5
   enter operation [a/r/q] and number: a 3
   your numbers: 3 5
   enter operation [a/r/q] and number: a 12
   your numbers: 3 5 12
   enter operation [a/r/q] and number: q
   

   The size of the user input can be arbitrarily large. For this program, to accommodate user input, you need to implement an integer array whose size varies as necessary. The numbers in the array should not be sorted. You should use the functions prototyped in this header file. The functions there are as follows:

   • addNumber() takes a pointer to the array and adds a number to the array. The pointer to the array is passed by reference. Note that the array cannot be enlarged to accommodate the number. Instead, this function needs to allocate a new array whose size is one more than the size of the old array, copy the contents of the old array to the new one, include the new number, deallocate the old array and then assign the address of the new array back to the original pointer.

     Note that since the pointer is passed by reference, the call to this function results in effectively "enlarging" the array pointed to by the pointer.

   • removeNumber() takes a pointer to the array, a number, and removes the number if it is present in the array. If the number is removed, the array shrinks.

     Note that the function should not change an array in any way if the number is not present in it. If the number is present, then the function should allocate a new array of smaller size and then copy all the numbers to it, except the one that needs to be erased. After copying is done, deallocate the old array and update the array pointer to point to the new array.

   • copyArray() - takes an array, dynamically allocates an array of the same size and (in a for-loop) copies the values from the old array to the new array. This function is to be used in output() described next.

   • output() takes a pointer to the array and prints its contents in the increasing order. For that you need to find, print and then delete the smallest number in the array. The pseudocode for this function is as follows

       create copy of the original array by invoking copyArray() then
       operate on the copy as it will be destroyed during printout
     
       while array is not empty
           assume that the first element of the array is the smallest found number
           for each subsequent element in the array - compare with the smallest
                if the element is smaller update the smallest found 
           print the smallest found number
           call removeNumber() with the smallest found to be removed
       

   Hint: Study this example code to see the techniques to use for the above functions.