Answer to Question #27588 in C++ for shahzad

Question

Implement array-based list for integers; following methods should be implemented. Dynamic array would be preferred.
void insertAtPosition(int x,int pos); //insert value x at given position
void insertAtEnd(int x); //insert value at the end of the array
void insertAtFront(int x); //insert value at the first position of the array
void removeFromFront(); //remove element from first position and move all element up //to fill the gap
void removeFromEnd(); //remove element from the end of the array
void removeFromPosition(int pos); //remove element from the position given by user. After the //operation there should be no gap in the elements of array
int find(int x) const; //return the index
int findPosition(int pos) const; //find at given position and return the value
bool IsEmpty() const; //return true if list is empty
bool isFull() const; //return true if list is full
void print() const; //print the whole list
Note: Implement the main() to show that all above given methods are working properly