Write a non-recursive algorithm to compute n!?
-
write a non-recursive algorithm to compute n!
-
Answer:
nfact = 1 for i = 2 to n nfact = nfact*i next i Or do you consider that "recursive." To me recursive means n! = n (n-1)!.
GTKC6IMNF3K7ENQIQXOJKS4TRA at Yahoo! Answers Visit the source
Related Q & A:
- How to do a MySQL recursive query?Best solution by Stack Overflow
- Is there a difference between a non-profit and a not-for-profit?Best solution by Yahoo! Answers
- Is this a good idea for a non-profit organization?Best solution by Yahoo! Answers
- What is the difference between a non-profit organization and a non-governmental organization?Best solution by maxwell.syr.edu
- Is there any differences between a non for profit hospital and a for profit hospital?Best solution by eHow old
Just Added Q & A:
- How many active mobile subscribers are there in China?Best solution by Quora
- How to find the right vacation?Best solution by bookit.com
- How To Make Your Own Primer?Best solution by thekrazycouponlady.com
- How do you get the domain & range?Best solution by ChaCha
- How do you open pop up blockers?Best solution by Yahoo! Answers
For every problem there is a solution! Proved by Solucija.
-
Got an issue and looking for advice?
-
Ask Solucija to search every corner of the Web for help.
-
Get workable solutions and helpful tips in a moment.
Just ask Solucija about an issue you face and immediately get a list of ready solutions, answers and tips from other Internet users. We always provide the most suitable and complete answer to your question at the top, along with a few good alternatives below.