#include #include #include using namespace std; class RandomArray { protected: int size = 0; int *arr = NULL; public: static void init() { srand(time(0)); } RandomArray(int size) { generate(size); } void generate(int size) { // free memory for array arr if is actualy allocated if (this->arr != NULL) { delete this->arr; } this->size = size; this->arr = new int[size]; for (int i = 0; i < size; i++) { *(this->arr + i) = rand() % 100; } } void reverse() { int tmp; int j = this->size - 1; for (int i = 0; i < j; i++) { tmp = *(this->arr + i); *(this->arr + i) = *(this->arr + j); *(this->arr + j) = tmp; j = this->size - i - 2; } } void print() { for (int i = 0; i < this->size; i++) { cout << *(this->arr + i) << " "; } cout << endl; } }; int main() { int size = 5; RandomArray::init(); RandomArray *a = new RandomArray(size); cout << "RandomArray of size " << size << ":" << endl; a->print(); a->reverse(); cout << "in reverse order is:" << endl; a->print(); size = 26; a->generate(size); cout << endl << "And now ... something longer, size " << size << ":" << endl; a->print(); a->reverse(); cout << "in reverse order is:" << endl; a->print(); return 0; }

Quick reverse order of array values