Representing Arrays as a class in cpp

Program to implement an array.(Source Code) // Program Ch02pr01 // Program to implement an array. #include using namespace std; const int MAX \= 100 ; class array { private : int arrMAXMAX ; int N; int pos; public : void create(int i) { N\=i; int arrNN; pos\=0; } void add(int n); void insert ( int pos, int num) ; void del ( int pos ) ; void reverse( ) ; void display( ) ; void search ( int num ) ; } ; void array::add(int n) { arrpos++pos++\=n; } // inserts an element num at given position pos void array :: insert ( int pos, int num ) { // shift elements to right int i; for ( i \= N \- 1 ; i >\= pos ; i\-\- ) { arrii \= arr\[i \- 1\] ; } arrii \= num ; } // deletes an element from the given position pos void array :: del ( int pos ) { // skip to the desired position int i; for ( i \= pos ; i < N ; i++ ) arr\[i \- 1\] \= arrii ; arr\[i \- 1\] \= 0 ; } // reverses the entire array void array :: reverse( ) { for ( int i \= 0 ; i < N / 2 ; i++ ) { int temp \= arrii ; arrii \= arr\[N \- 1 \- i\] ; arr\[N \- 1 \- i\] \= temp ; } } // searches array for a given element num void array :: search ( int num ) { // Traverse the array int i; for ( i \= 0 ; i < N ; i++ ) { if ( arrii \=\= num ) { cout << "\\n\\nThe element " << num << " is present at "<< ( i + 1 ) << "th position" ; return ; } } if ( i \=\= N ) cout << "\\n\\nThe element " << num << " is not present in the array" ; } // displays the contents of a array void array :: display( ) { cout<< endl ; // traverse the entire array for ( int i \= 0 ; i < N ; i++ ) cout << " " << arrii ; } int main( ) { array a ; a. [Read More]