Question: Given an array, A, describe an efficient algorithm for reversing A. For example, if A = [3, 4, 1, 5], then its reversal is A
Given an array, A, describe an efficient algorithm for reversing A. For example, if A = [3, 4, 1, 5], then its reversal is A = [5, 1, 4, 3]. You can only use O(1) memory in addition to that used by A itself. What is the running time of your algorithm?
Step by Step Solution
3.30 Rating (174 Votes )
There are 3 Steps involved in it
the ... View full answer
Get step-by-step solutions from verified subject matter experts
