Question: Given an array, A, describe an efficent algorithm for reversing A. For example, if A = [3, 4, 1, 5], then it's reveral is A
Given an array, A, describe an efficent algorithm for reversing A. For example, if A = [3, 4, 1, 5], then it's reveral 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 algorthm?
Present the algorithm in pseudocode and then explain the runtime of the algorithm. Do not use any built-in code library methods in your solution.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
