Homework, Data Structure & Algorithms

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







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

Write discussion on Homework
Your posts are moderated
Related Questions
pseudo code for fibonnaci series

Construct a B+ tree for the following keys, starting with an empty tree.  Each node in the tree can hold a maximum of 2 entries (i.e., order d = 1). Start with an empty root nod

You are given two jugs, a 4-gallon one and a 3-gallon one. Neither has any measuring marker on it. There is a tap that can be used to fill the jugs with water. How can you get exac

What will be depth do , of complete binary tree of n nodes, where nodes are labelled from 1 to n with root as node and last leaf node as node n

What is called the basic operation of an algorithm? The most significant operation of the algorithm is the operation contributing the most to the total running time is known as

What are the languages which support assertions Languages which support assertions often provide different levels of support. For instance, Java has an assert statement which t

Asymptotic Analysis Asymptotic analysis is depending on the idea that as the problem size grows, the complexity can be defined as a simple proportionality to some known functio

what do you understand by structured programming?explain with eg. top down and bottem up programming technique

In the array implementation of the lists, we will use the array to hold the entries and a separate counter to keep track of the number of positions are occupied. A structure will b