help writing a non-recursive procedure [closed]

This is a question on my homework could you help me figure it out?

Write a non-recursive procedure that takes an array and its length and prints its elements in the reverse order. For example, if the array has elements 77, 12, 90, 34, 45, the procedure should print the values 45, 34, 90, 12, 77. Here is the header for the procedure: Procedure printReverse(array[], length)

-
This would do much better on StackExchange - there's essentially no element of this question that involves mathematics. –  Steven Stadnicki Dec 16 '10 at 0:29
@Steven: StackOverflow, you mean. ;) –  Ｊ. Ｍ. Dec 16 '10 at 0:33
So THIS is where all of the terrible questions on StackOverflow originate! –  Eric Mickelsen Dec 16 '10 at 4:59
That's a bit unfair, @Eric, –  Ｊ. Ｍ. Dec 16 '10 at 6:25

closed as off topic by Ｊ. Ｍ., Ross Millikan, Bill Dubuque, Aryabhata, Arturo MagidinDec 16 '10 at 3:57

Questions on Mathematics Stack Exchange are expected to relate to math within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here.If this question can be reworded to fit the rules in the help center, please edit the question.

Ross is correct. Remember that a recursive function is one that calls itself. Writing a for loop as follows involves no such recursion:

for(int i = length - 1; i >= 0; i--) cout << array[i] << " ";

-
@Ross: Since I can't comment on other posts yet, my code is in C++. Also, I didn't really understand NEWprogrammer's objection to your pseudocode answer so I thought I'd formally write it out in a programming language to show that no recursion was used. –  Jason Dec 16 '10 at 1:34