{"id":31093,"date":"2016-02-12T09:25:00","date_gmt":"2016-02-12T15:25:00","guid":{"rendered":"http:\/\/netosanchezb.wordpress.com\/?p=267"},"modified":"2016-02-12T09:28:38","modified_gmt":"2016-02-12T15:28:38","slug":"factorial-calculator-5","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101winter2016\/2016\/02\/factorial-calculator-5\/","title":{"rendered":"Factorial calculator"},"content":{"rendered":"

The image above is what my computer outputs when I run this program, a factorial calculator.\u00a0<\/strong><\/p>\n

It is a basic factorial calculator. The factorial of a number, lets say of number 5 (written 5!) is the multiplication of 5*4*3*2*1. The result of that operation would be 120.<\/p>\n

In order to do this operation in C++, you have to use a loop or recursion. On my first try of this program I decided to use a For Loop. I\u00b4ll try to do it this weekend with recursion.<\/p>\n

For this program to work, I created a function called “facto” with one parameter. The parameter is the number you want to get the factorial from.<\/p>\n

So I declared an int variable called op and initialized it to 1. The operation inside the for loop is op = op * n, which is a number between 1 and a number less or equal to the required by the user, as you can see in my for loop.<\/p>\n

int f, n, op =1;<\/strong>
\nchar answer = ‘y’;<\/strong><\/p>\n

int facto(int x){<\/strong><\/p>\n

for (n = 1; n <= x; n++){<\/strong><\/p>\n

op = op * n;<\/strong>
\n }<\/strong><\/p>\n

return op;<\/strong>
\n}<\/strong><\/p>\n

A cool thing about this program is that it asks the user if he wants to repeat the process with another number, or if he wnats to end the program. I achieved this doing a do while loop.<\/p>\n

Here you can have a look at my program:<\/p>\n

\"WSQ09\"<\/p>\n

And here is the code:<\/p>\n

#include <iostream><\/strong>
\nusing namespace std;<\/strong><\/p>\n

int f, n, op =1;<\/strong>
\nchar answer = ‘y’;<\/strong><\/p>\n

int facto(int x){<\/strong><\/p>\n

for (n = 1; n <= x; n++){<\/strong><\/p>\n

op = op * n;<\/strong>
\n }<\/strong><\/p>\n

return op;<\/strong>
\n}<\/strong><\/p>\n

int main(){<\/strong><\/p>\n

do {<\/strong>
\n cout << “Enter the number that you want to obtain the factorial from: ” << endl;<\/strong>
\n <\/p>\n

\"\"<\/div>\n
\"\"<\/div>\n

>> f;<\/strong>
\n cout << “The factorial of ” << f << “is equal to: ” << facto(f) << endl;<\/strong>
\n cout << “Do you want to try another number? (type y if you do, type anything else if not): ” << endl;<\/strong>
\n cin >> answer;<\/strong><\/p>\n

} while (answer == ‘y’);<\/strong><\/p>\n

cout << “Thanks for using my program!”;<\/strong>
\n}<\/strong><\/p>\n

Thanks for reading!<\/p>\n

\"\"<\/a> \"\"<\/p>\n","protected":false},"excerpt":{"rendered":"

The image above is what my computer outputs when I run this program, a factorial calculator.\u00a0 It is a basic factorial calculator. The factorial of a number, lets say of number 5 (written 5!) is the multiplication of 5*4*3*2*1. The result of that operation would be 120. In order to do this operation in C++, … Continue reading Factorial calculator<\/span><\/a><\/p>\n","protected":false},"author":5,"featured_media":31095,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,4],"tags":[68,127],"class_list":["post-31093","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-blogs","category-syndicated","tag-sincategoria","tag-wsq09"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/31093","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/comments?post=31093"}],"version-history":[{"count":2,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/31093\/revisions"}],"predecessor-version":[{"id":31100,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/31093\/revisions\/31100"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media\/31095"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media?parent=31093"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/categories?post=31093"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/tags?post=31093"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}