Reverse an array

#1

Replace first element with the last element and so on till middle

#2

Yes @kumarakash121005
Maintain 2 pointers…

int start =  0;
int end = n-1; // n is the size of array
while(start <= end){
swap(arr[start],arr[end]);
start++;
end--;
}
#3

hi @kumarakash121005
i hope it should be clear now… shall i mark this doubt as resolved??

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.