12. (10 points) Consider the following algorithm. // Assume that n is a positive integer (=...

 

Transcribed Image Text:

12. (10 points) Consider the following algorithm. // Assume that n is a positive integer (= i.e. n > 1), and A[1..n] is a global array. // Note that the index of array A starts from one, not zero. // And also, don't forget the array A in the algorithm is global. Algorithm DoSomething (n) 1. if (n = 1) 2. print the current content of the whole array A on the screen: else for i 1 ton do DoSomething(n-1); // Recursive call. 3. 4. 5. 6. 7. swap A[1] and A[n]; 8. else 9. if n is odd 10. return; swap A[i] and A[n]: (a) Present execution result of the algorithm where an array A has "5" and n is 1. (b) Present execution result of the algorithm where an array A has "5, 7" and n is 2. (c) Present execution result of the algorithm where an array A has "5, 7, 9" and n is 3. 12. (10 points) Consider the following algorithm. // Assume that n is a positive integer (= i.e. n > 1), and A[1..n] is a global array. // Note that the index of array A starts from one, not zero. // And also, don't forget the array A in the algorithm is global. Algorithm DoSomething (n) 1. if (n = 1) 2. print the current content of the whole array A on the screen: else for i 1 ton do DoSomething(n-1); // Recursive call. 3. 4. 5. 6. 7. swap A[1] and A[n]; 8. else 9. if n is odd 10. return; swap A[i] and A[n]: (a) Present execution result of the algorithm where an array A has "5" and n is 1. (b) Present execution result of the algorithm where an array A has "5, 7" and n is 2. (c) Present execution result of the algorithm where an array A has "5, 7, 9" and n is 3.