Objective

Implement a function that reverses the order of the first n elements of an integer array in place, without allocating a second array.

Steps

• a points to the first element of a mutable array, and n is how many leading elements you must reverse.
• Swap the front element with the back one, then step both cursors toward the middle until they meet or cross.
• Work in place: no temporary array of n elements, no copy. A single int to hold a value during a swap is fine.
• There is no terminator here, unlike a string. n is the only thing that tells you where the region ends.
• An n of 0 leaves the array exactly as it was. An odd n keeps the middle element in place.
• When n is smaller than the real length of the array, only that prefix is reversed and every element after it stays where it was.
• The tests print the array after the call: values on one line, separated by a single space, followed by a newline.

Objective

Implement a function that reverses the order of the first n elements of an integer array in place, without allocating a second array.

Steps

• a points to the first element of a mutable array, and n is how many leading elements you must reverse.
• Swap the front element with the back one, then step both cursors toward the middle until they meet or cross.
• Work in place: no temporary array of n elements, no copy. A single int to hold a value during a swap is fine.
• There is no terminator here, unlike a string. n is the only thing that tells you where the region ends.
• An n of 0 leaves the array exactly as it was. An odd n keeps the middle element in place.
• When n is smaller than the real length of the array, only that prefix is reversed and every element after it stays where it was.
• The tests print the array after the call: values on one line, separated by a single space, followed by a newline.