a little help with dynamic arrays in classes

[malt]

I'm writing a program that takes a given amount of numbers then outputs them evenly in a list. Here is the code:

// This is a program that will promt the user for input of any given amount of values.
// The program will then list the values in numeric order.

#include <cstdlib>
#include <iostream>
#ifndef VECTORDOUBLE_H
#define VECTORDOUBLE_H

using namespace std;

class vectorDouble
{
	public:
		
       void fillArray (int a[], int size);
       void sort (int a[], int size);
       void swapValues (int &v1, int&v2);
       int indexOfSmallest (const int a[], int startIndex, int size);
           
};

#endif
    
int main()
{
    int arraySize;
    
    vectorDouble value;
    
    using namespace std;
    
    cout << "This program will sort a list of numbers from lowest to highest"<< endl;
    cout << "How many numbers do you want to sort? " << endl;
    
    cin >> arraySize;
    
    typedef int* IntArrayPtr;
    IntArrayPtr a;
    a = new int[arraySize];
    
    value.fillArray (a, arraySize);
    value.sort (a, arraySize);
    
    cout << "In sorted order the numbers are: " << endl;
    for (int index = 0; index < arraySize; index++)
        cout << a[index] << " ";
    
    new int[arraySize];
    
    cout << endl << *a;
       
    cout << endl;
        
    delete [] a;
    
    system("PAUSE");
    return EXIT_SUCCESS;
  }
  
  void vectorDouble::fillArray (int a[], int size)
  {
       using namespace std;
       
           cout << "Enter " << size << " integers." << endl;
       
       for (int index = 0; index < size; index++)
       {
           cin >> a[index];
       }
       }
          
  void vectorDouble::sort(int a[], int size)
  {
       int nextSmallest;
       
       for (int index = 0; index < size - 1; index++)
       {
           nextSmallest = indexOfSmallest(a, index, size);
           swapValues(a[index], a[nextSmallest]);
       }
       }
       
  void vectorDouble::swapValues(int& v1, int& v2)
  {
       int temp;
           temp = v1;
           v1 = v2;
           v2 = temp;
       }
       
  int vectorDouble::indexOfSmallest( const int a[], int startIndex, int size)
  { 
       int min = a[startIndex],
      
          indexOfMin = startIndex;
      
       for(int index = startIndex + 1; index < size; index++)
      
       if (a[index] < min)
       {
          min = a[index];
          indexOfMin = index;
          }
                     
  return indexOfMin;
  }         
          
         
    

My problem is that I would like to put typedef int* IntArrayPtr; on line 37 into the vectorDouble class and have it work as a function outside of the main part of the program. I'm a bit confused on how to do so. Should I make the pointer a private member variable and create a function to work with the pointer? Could someone give me some help on this?

Thank you.

[Zhuge]

I think you have the right idea. Make the array a member of the class, then instead of having the methods take a pointer to the array to fill/sort/c, just have those methods use the member of the class.