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

#, write an algorithm to search a particular node in linked list which retu... write an algorithm to search a particular node in linked list which returns " FOUND" or "NOT FOUND" as outcome.

Hashing, what is hashing? what are diffrent method of hashing? what is hashing? what are diffrent method of hashing?

Siso-4bit register, explain working of siso-register to store 1011 and show... explain working of siso-register to store 1011 and show timing diagram &table

Explain circular queues, Circular Queues:- A more efficient queue repre... Circular Queues:- A more efficient queue representation is get by regarding the array Q(1:n) as circular. It becomes more convenient to declare the array as Q(O: n-1), when  re

Functions for inserting and deleting at either end of deque, Q. Devise a re... Q. Devise a representation for a given list where insertions and deletions can be made at both the ends. Such a structure is called Deque (which means Double ended queue). Write fu

Write procedure to the insert a node into the linked list, Q. Write a proce... Q. Write a procedure to the insert a node into the linked list at a particular position and draw the same by taking an example?

Homework, Write a recursive function the computes the number of digits in a... 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 thresho

Doubly linked list having n nodes, The time required to delete a node x fro... The time required to delete a node x from a doubly linked list having n nodes is O (1)

Preorder traversal of a binary tree, Preorder traversal of a binary tree ... Preorder traversal of a binary tree struct NODE { struct NODE *left; int value;     /* can take any data type */ struct NODE *right; };   preorder(struct N

Sparse matrix, How sparse matrix stored in the memory of a computer? How sparse matrix stored in the memory of a computer?