![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1683781027790-Reverse%20Elements%20of%20an%20Array%20in%20C%2B%2B.jpg\")
<\/p>\n<\/p>\n
When an array is reversed, the items of the original array are changed in order. With this method, the first element becomes the last and the last element becomes the first one in the array. However, the procedure keeps going until all characters or array elements are entirely reversed.<\/p>\n
For instance, if an array has elements like "C," "O," "D," and "E," and we reverse all of those elements, the result is "E," "D," "O," and "C." In this manner, the array’s characters are all reversed.<\/p>\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1683781027947-1-01%20%2890%29.png\")
<\/p>\n
The different approaches to obtaining the reverse array in C++ are listed below.<\/p>\n
This method involves inverting the remainder of the array while repeatedly splitting it into smaller subarrays.<\/p>\n
To reverse the array arr from index start to index end, let’s define the recursive function reverse(start, end, arr). The start and end are both set to 0 at the beginning. We switch the arr[end] and arr[start] in each iteration of the recursive step before calling the function for the subarray start+1 and end-1.<\/p>\n
The mechanism described above is emulated as follows::<\/p>\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1683781027954-1-02%20%2847%29.png\")
<\/p>\n
Algorithm<\/strong><\/p>\n The same code is called recursively for the subarrays start+1 and end-1.<\/p>\n Now, let\u2019s look into the code implementation to reverse elements of an array in C++.<\/p>\n Code Implementation in C++<\/strong><\/p>\n\t\t\t\t\t\t\n
reverse(start,end,arr):\n swap(arr[start],start[end])\n reverse(start+1,end-1,arr)<\/code><\/pre>\n<\/li>\n<\/ul>\n