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..
What is Polyphase Sort, One of the best known methods for external sorting ...
One of the best known methods for external sorting on tapes is the polyphase sort. Principle: The basic strategy of this sort is to distribute ordered initial runs of predetermi
B – trees, B-trees are special m-ary balanced trees utilized in databases s...
B-trees are special m-ary balanced trees utilized in databases since their structure allows records to be added, deleted & retrieved with guaranteed worst case performance. A B-
Algorithm for linear search, Here, m represents the unordered array of ele...
Here, m represents the unordered array of elements n represents number of elements in the array and el represents the value to be searched in the list Sep 1: [Initialize]
Cache simulator, how to design a cache simulator with 4-way set associative...
how to design a cache simulator with 4-way set associative cache
Implementation of queue, For a queue a physical analogy is a line at bookin...
For a queue a physical analogy is a line at booking counter. At booking counter, customers go to the rear (end) of the line & customers are attended to several services from the fr
Big o notation, This notation gives an upper bound for a function to within...
This notation gives an upper bound for a function to within a constant factor. Given Figure illustrates the plot of f(n) = O(g(n)) depend on big O notation. We write f(n) = O(g(n))
Define minimum spanning tree, Define Minimum Spanning Tree A minimum sp...
Define Minimum Spanning Tree A minimum spanning tree of a weighted linked graph is its spanning tree of the smallest weight, where the weight of a tree is explained as the sum
Sequential search of a list is preferred over binary search, What are the c...
What are the conditions under which sequential search of a list is preferred over binary search? Sequential Search is a preferred over binary search when the list is unordered
Darw a flowchart for inputs number of hours of sunshine, This algorithm inp...
This algorithm inputs number of hours of sunshine recorded every day for a week (7 days). Output is the highest value for hours of sunshine and average (mean) value for numbers of
The space - time trade off, The Space - Time Trade Off The best algorit...
The Space - Time Trade Off The best algorithm to solve a given problem is one that needs less space in memory and takes less time to complete its implementation. But in practic
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
IT Courses and 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.