Array Reverse - CA05

My Thinking and Approach Introduction In this problem, I was given an array of integers and asked to reverse the array. Reversing an array means rearranging the elements such that the first element becomes the last, the second element becomes second last and so on. Problem Statement Given an array of integers arr Reverse the array After reversing: First element becomes last Second element becomes second last Continue this pattern My Initial Thought At first, I considered: Creating a new array Adding elements in reverse order But this approach uses extra space. Key Observation Instead of using extra space: I can swap elements from both ends Move towards the center Optimized Approach I decided to: Use two pointers Swap elements in-place Logic: Start one pointer at beginning Start another pointer at end Swap elements Move both pointers towards center My Approach (Step-by-Step) Initialize two pointers: left = 0 right = length - 1 While left < right: Swap arr[left] and arr[right] Move left