Array of Pointers to ints

[mc84ss]

This is my assignment and I thought I made a program that would work, but the instructor says that we need an array of pointers. I had an array of ints that the pointers referenced. Here is my assignment via cut and paste. I am confused as how to store numbers that the array of pointers can access with out putting the numbers in another array? Any advice would be greatly appreciated. Also happy early thanksgiving.

Assignment
Develop and compile a properly documented C++ program that provides array data storage and manipulation identified below:
Store (can be initialized or entered by the user after prompted) 10 different pointers to integers in random order in an array.
Provide the following menu options:
Display array data: displays the data pointed to by the array element on the screen.
Sort Array data: Sorts data pointed to by the array elements in ascending order within the array.
Add data (up to 5 additional pointer elements and the data they point to) to the sorted array. Data must be inserted in the array in such a way that the array remains sorted.
Find and display an integer value entered by the user and tell the user what array element pointer points to that integer.

#include "stdafx.h"
#include <iostream>
#include <iomanip>
#include <Windows.h>
#include <stdlib.h>
#include <time.h>
#include <cstdlib>
using namespace std;

void insertionSort( int[], int, int );


int main()
{
	const int size = 100000;
	int temp, i, j, list[size] = {};
	int *dptr;
	dptr = &list[0];
	int count = 0;
	int n = 15;
	int selection = 0;
		
	do
	{
	
		cout << "\n1) Enter useable Array Size, default = 15, max = 100000\n";
		cout << "2) Manually enter Array data for initial elements\n";
		cout << "3) Book Sort current Array\n";
		cout << "4) Display Array\n";
		cout << "5) Insert final 5 elements of Array\n";
		cout << "6) Have computer enter random numbers for you\n";
		cout << "7) Have computer enter final 5 random numbers for you\n";
		cout << "8) Find Interger and its location\n";
		cout << "9) Exit\n";
		cin >> selection;
		

		if ( selection == 1 ) // get the list size, or array size from the user
		{
			cout<<"\nEnter the size of your Array: Min 5, Max 100000\n";
			cin>>n;

			// make sure user can not input array that is to small or to large
			while( ( n < 5 ) || ( n > 100000 ) )
			{
				cout << "Try entering something between 5 and 100000\n";
				cin >> n;
			}//end while
			
		}//end if selection 1


		if ( selection == 2 ) // prompt for user to input initial 10 elements of array
		{
			for( i = 0; i < ( n - 5 ); i++)
			{
			cout<<"Enter list's element #"<<i<<"-->";
			cin >> dptr[i];
			}
		}


		if ( selection == 3 ) // Sort function call
		{
			insertionSort( dptr, n, count );// function call to sort
		}//end selection 3

		
		if ( selection == 4 ) // Display Array 
		{
			for( int j = 0; j < ( n - 5 + count ) ; ++j)
				{
					if ( j < 10 )
					{
						//cout << "Element# " << j <<  "        " << list[j] << "\n";
						cout << "*( dptr + " << j << " ) =      " << *( dptr + j ) << "\n";
					}
					else
						//cout << "Element# " << j <<  "       " << dptr[j] << endl;
						cout << "*( dptr + " << j << " ) =     " << *( dptr + j ) << "\n"; 
				}//end for
			

		}//end selection 4



		if ( selection == 5 ) //insert final 5 elements of array
		{
			int diff;
			int grapeseed = 0;//Same random word

			cout << "How many intergers would you like to insert?\n";
			cin >> diff;
			
			for( i = n - 5 + count; (i < n) && (grapeseed < diff ) ; i++ )
				{
					cout<<"Enter array element # "<<i<<"-->";
					cin>>dptr[i];

					count++;
					grapeseed++;
				}// end for

			insertionSort( dptr, n, count );// sort function

		}//end selection 5



		if ( selection == 6 ) // let computer insert random numbers for me and give time in seconds to complete
		{
			int r;
			int Q = 49;
			
			for(i=0; i<n-5; i++)
			{
				// initialize random seed
				srand( time(0) * Q );	
				r = rand() % 1000 +1;

				dptr[i] = r;
				Q++;
			}//end for
			
		}//end selection 6



		if ( selection == 7 ) //insert final 5 elements of array
		{
			int r;
			int Q = 14;
						
			for(i=n-5; i<n; i++)
			{
				// initialize random seed
				srand( time(0) * Q );	
				r = rand() % 1000 +1;

				dptr[i] = r;
				Q++;
				count++;
			}//end for

			insertionSort( dptr, n, count );// sort function

		}//end selection 7

		if ( selection == 8 )
		{
			int findme = 0;
			int i = 0;

			cout << "Enter interger value to find\n";
			cin >> findme;

			for ( i;  (findme != *( dptr + i)) && ( i <= n ); i++ )
				{
					//nothing to see here, keep moving on
				}

			if ( i <= n )
				cout << "*( dptr + " << i << " )" << " is where " << findme << " is located\n";
			else
				cout << " You select a number that is not in the array\n";

		}//end if selection 8

		
	} while ( selection != 9 );//end do while loop

	return 0; //exit
}//end main


void insertionSort( int dptr[], int n, int count ) //Sort function from book
{
	int insert = 0;//Variable Dec
	
	for( int next = 1; next < ( n - 5 + count ); next++ )
	{
		insert = dptr[ next ]; // store the value in the current element

		int moveItem = next; // initialize location to place element
	  
		// search for the location in which to put the current element     
		while ( ( moveItem > 0 ) && ( dptr[ moveItem - 1 ] > insert ) )
		{
			// shift element one slot to the right
			dptr[ moveItem ] = dptr[ moveItem - 1 ];
			moveItem--;
		} // end while
   
		dptr[ moveItem ] = insert; // place inserted element into the array
	} // end for
}//end insertion sort function 

[Mathhead200]

The syntax would look like: int **x = new int*[10];.
Then later to access the actual ints you would have to dereference the elements, like:
*x[5]; //dereference the sixth pointer in the array .