Write a recursive function the computes the number of digits in a positive integer n.
For example if n = 6598, the function should return 4.
Find a variant expression and a threshold to show that the function has no infinite
recursion.

Posted Date: 11/19/2012 10:46:11 AM | Location : United States

Ask an Expert

Related Discussions:- Homework, Assignment Help, Ask Question on Homework, Get Answer, Expert's Help, Homework Discussions

Write discussion on Homework
Your posts are moderated

Write your message here..

Related Questions

Linked List Variations, Part1: Deque and Bag Implementation First, complet... Part1: Deque and Bag Implementation First, complete the Linked List Implementation of the Deque (as in Worksheet 19) and Bag ADTs (Worksheet 22). Files Needed: linkedList.c Linke

Threaded Binary Tree, If a node in a binary tree is not containing left or ... If a node in a binary tree is not containing left or right child or it is a leaf node then that absence of child node can be represented by the null pointers. The space engaged by

Fibonnaci series, pseudo code for fibonnaci series pseudo code for fibonnaci series

Algorithm, write an algorithm given each students name and grade points for... write an algorithm given each students name and grade points for six courses.find his grade point average and group students into the gpa groups 3.5

Indexed sequential file organisation, When there is requirement to access r... When there is requirement to access records sequentially by some key value and also to access records directly by the similar key value, the collection of records may be organized

Use a random number generator to create 10 numbers, Use a random number gen... Use a random number generator to create 10 numbers between 1 and 1000 and store them in 2 different arrays.  The first array should contain the numbers as they are generated.  The

Two broad classes of collision resolution techniques, Two broad classes of ... Two broad classes of collision resolution techniques are A) open addressing and B) chaining

Space and time complexity, why the space increase in less time programs why the space increase in less time programs

Enumerate the types in ruby, Enumerate the Types in Ruby Ruby is a pure... Enumerate the Types in Ruby Ruby is a pure object-oriented language, meaning that all types in Ruby are classes, and each value in a Ruby program is an instance of a class. Thi

Acyclic graphs, Acyclic Graphs In a directed graph a path is said to fo... Acyclic Graphs In a directed graph a path is said to form a cycle is there exists a path (A,B,C,.....P) such that A = P. A graph is called acyclic graph if there is no cycle in