Customer Service Chat
Get quote & make Payment
Find error for curious number, Data Structure & Algorithms
int sumFact(int numb);
int calculateFactorial(int digit);
int numb, sumfact;
printf ("Enter a number 1 to 9999\n");
while (!(numb >= 1 && numb <=9999));
sumfact = sumFact(numb);
if (numb == sumfact)
printf("\nThe Number %d you entered is curious number", numb);
printf("\n not a curious number", numb);
int sumFact (int numb)
int rightdigit, sumfact = 0;
while (numb != 0)
rightdigit = numb%10;
numb = numb /10;
sumfact = sumfact + calculateFactorial (rightdigit);
int calculateFactorial (int digit)
if ((digit == 0 ) && (digit == 1))
factval = digit*calculateFactorial (digit-1);
Posted Date: 3/16/2013 4:55:04 PM | Location : United Arab Emirates
Ask an Expert
Find error for curious number, Assignment Help, Ask Question on Find error for curious number, Get Answer, Expert's Help, Find error for curious number Discussions
Write discussion on Find error for curious number
Your posts are moderated
Write your message here..
Algorithm to merge two sorted arrays with third array, Q. Write down an alg...
Q. Write down an algorithm to merge the two sorted arrays into the third array. Do not perform the sort function in the third array. Ans: void m
Tic Tac Toe game , Book to refer: Introduction to Algorithms, 3rd Ed, by Cl...
Book to refer: Introduction to Algorithms, 3rd Ed, by Clifford Stein, Thomas H. Cormen, Ronald Rivest, Charles E. Leiserson Question: Tic Tac Toe game -Design a GUI and implement
Program insertion of a node into any circular linked list, Program Insertio...
Program Insertion of a node into any Circular Linked List Figure depicts a Circular linked list from which an element was deleted. ALGORITHM (Deletion of an element from a
Infix expression into the postfix expression, Q. Write down an algorithm to...
Q. Write down an algorithm to convert an infix expression into the postfix expression. Ans. Algo rithm to convert infix expression to post fix expression is given as
Sorting, explain quick sort algorithm
explain quick sort algorithm
Aa-trees, Red-Black trees have introduced a new property in the binary sear...
Red-Black trees have introduced a new property in the binary search tree that means an extra property of color (red, black). However, as these trees grow, in their operations such
Stack, infix to revrse polish
infix to revrse polish
Graph, Multilist Representation of graph
Multilist Representation of graph
Explain backtracking, Explain Backtracking The principal idea is to co...
Explain Backtracking The principal idea is to construct solutions single component at a time and evaluate such partially constructed candidates as follows. If a partiall
Program on radix sort., Write a program that uses the radix sort to sort 10...
Write a program that uses the radix sort to sort 1000 random digits. Print the data before and after the sort. Each sort bucket should be a linked list. At the end of the sort, the
Accounting Assignment Help
Economics Assignment Help
Finance Assignment Help
Statistics Assignment Help
Physics Assignment Help
Chemistry Assignment Help
Math Assignment Help
Biology Assignment Help
English Assignment Help
Management Assignment Help
Engineering Assignment Help
Programming Assignment Help
Computer Science Assignment Help
Why Us ?
~24x7 hrs Support
~Quality of Work
~Time on Delivery
~Privacy of Work
Human Resource Management
Literature Review Writing Help
Follow Us |
T & C
Copyright by ExpertsMind IT Educational Pvt. Ltd.